./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_JEN_test3-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 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:40:49,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:40:49,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:40:49,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:40:49,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:40:49,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:40:49,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:40:49,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:40:49,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:40:49,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:40:49,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:40:49,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:40:49,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:40:49,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:40:49,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:40:49,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:40:49,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:40:49,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:40:49,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:40:49,196 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 -> 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 [2025-02-06 08:40:49,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:40:49,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:40:49,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:40:49,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:40:49,504 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:40:49,506 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_JEN_test3-2.i [2025-02-06 08:40:50,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4afab4d9/391424adc228494c90ffdf9eab16dbdd/FLAGaf240b7ce [2025-02-06 08:40:51,078 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:40:51,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i [2025-02-06 08:40:51,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4afab4d9/391424adc228494c90ffdf9eab16dbdd/FLAGaf240b7ce [2025-02-06 08:40:51,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4afab4d9/391424adc228494c90ffdf9eab16dbdd [2025-02-06 08:40:51,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:40:51,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:40:51,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:40:51,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:40:51,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:40:51,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5f1f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51, skipping insertion in model container [2025-02-06 08:40:51,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:40:51,414 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_JEN_test3-2.i[33021,33034] [2025-02-06 08:40:51,491 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_JEN_test3-2.i[44590,44603] [2025-02-06 08:40:51,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:40:51,522 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:40:51,558 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_JEN_test3-2.i[33021,33034] [2025-02-06 08:40:51,598 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_JEN_test3-2.i[44590,44603] [2025-02-06 08:40:51,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:40:51,630 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:40:51,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51 WrapperNode [2025-02-06 08:40:51,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:40:51,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:40:51,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:40:51,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:40:51,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,701 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1569 [2025-02-06 08:40:51,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:40:51,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:40:51,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:40:51,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:40:51,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,800 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 34, 267]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-02-06 08:40:51,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:40:51,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:40:51,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:40:51,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:40:51,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (1/1) ... [2025-02-06 08:40:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:40:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:40:51,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:40:51,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:40:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:40:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:40:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:40:51,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:40:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:40:51,926 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:40:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:40:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:40:51,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:40:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:40:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:40:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:40:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:40:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:40:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:40:52,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:40:52,095 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:40:53,213 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:40:53,290 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-02-06 08:40:53,290 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:40:53,375 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:40:53,376 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:40:53,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:40:53 BoogieIcfgContainer [2025-02-06 08:40:53,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:40:53,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:40:53,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:40:53,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:40:53,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:40:51" (1/3) ... [2025-02-06 08:40:53,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43da9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:40:53, skipping insertion in model container [2025-02-06 08:40:53,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:40:51" (2/3) ... [2025-02-06 08:40:53,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43da9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:40:53, skipping insertion in model container [2025-02-06 08:40:53,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:40:53" (3/3) ... [2025-02-06 08:40:53,388 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test3-2.i [2025-02-06 08:40:53,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:40:53,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test3-2.i that has 5 procedures, 448 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-02-06 08:40:53,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:40:53,443 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;@6e544ae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:40:53,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:40:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 427 states have (on average 1.620608899297424) internal successors, (692), 434 states have internal predecessors, (692), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:40:53,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:53,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:53,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 190894067, now seen corresponding path program 1 times [2025-02-06 08:40:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914481202] [2025-02-06 08:40:53,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:40:53,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:40:53,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:53,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:40:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914481202] [2025-02-06 08:40:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914481202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:40:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233545982] [2025-02-06 08:40:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:40:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:53,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:40:53,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:40:53,557 INFO L87 Difference]: Start difference. First operand has 440 states, 427 states have (on average 1.620608899297424) internal successors, (692), 434 states have internal predecessors, (692), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:53,666 INFO L93 Difference]: Finished difference Result 878 states and 1419 transitions. [2025-02-06 08:40:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:40:53,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 08:40:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:53,679 INFO L225 Difference]: With dead ends: 878 [2025-02-06 08:40:53,679 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 08:40:53,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:40:53,687 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:53,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:40:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 08:40:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-06 08:40:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2025-02-06 08:40:53,741 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 9 [2025-02-06 08:40:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:53,742 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2025-02-06 08:40:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2025-02-06 08:40:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 08:40:53,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:53,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:53,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:40:53,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1646412687, now seen corresponding path program 1 times [2025-02-06 08:40:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:53,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207197687] [2025-02-06 08:40:53,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:53,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 08:40:53,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 08:40:53,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:53,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:40:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207197687] [2025-02-06 08:40:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207197687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033231837] [2025-02-06 08:40:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:53,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:53,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:53,901 INFO L87 Difference]: Start difference. First operand 404 states and 587 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:54,128 INFO L93 Difference]: Finished difference Result 1000 states and 1462 transitions. [2025-02-06 08:40:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:40:54,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 08:40:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:54,132 INFO L225 Difference]: With dead ends: 1000 [2025-02-06 08:40:54,132 INFO L226 Difference]: Without dead ends: 795 [2025-02-06 08:40:54,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:54,133 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 556 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:54,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1647 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:40:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-06 08:40:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 406. [2025-02-06 08:40:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2025-02-06 08:40:54,148 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 14 [2025-02-06 08:40:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:54,148 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2025-02-06 08:40:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2025-02-06 08:40:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:40:54,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:54,150 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:54,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:40:54,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:54,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1597532617, now seen corresponding path program 1 times [2025-02-06 08:40:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701865516] [2025-02-06 08:40:54,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:54,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:40:54,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:40:54,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:54,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:40:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701865516] [2025-02-06 08:40:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701865516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435000638] [2025-02-06 08:40:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:54,589 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:54,752 INFO L93 Difference]: Finished difference Result 766 states and 1108 transitions. [2025-02-06 08:40:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:40:54,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-06 08:40:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:54,754 INFO L225 Difference]: With dead ends: 766 [2025-02-06 08:40:54,756 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 08:40:54,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:54,757 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 30 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:54,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1340 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:40:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 08:40:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-06 08:40:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 352 states have (on average 1.4090909090909092) internal successors, (496), 358 states have internal predecessors, (496), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 512 transitions. [2025-02-06 08:40:54,776 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 512 transitions. Word has length 89 [2025-02-06 08:40:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:54,776 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 512 transitions. [2025-02-06 08:40:54,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 512 transitions. [2025-02-06 08:40:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:40:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:54,779 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:54,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:40:54,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:54,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 304650960, now seen corresponding path program 1 times [2025-02-06 08:40:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:54,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372108568] [2025-02-06 08:40:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:54,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:40:54,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:40:54,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:54,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:40:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372108568] [2025-02-06 08:40:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372108568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:40:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448638528] [2025-02-06 08:40:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:40:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:40:54,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:40:54,998 INFO L87 Difference]: Start difference. First operand 364 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:55,181 INFO L93 Difference]: Finished difference Result 986 states and 1402 transitions. [2025-02-06 08:40:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:40:55,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-06 08:40:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:55,187 INFO L225 Difference]: With dead ends: 986 [2025-02-06 08:40:55,188 INFO L226 Difference]: Without dead ends: 626 [2025-02-06 08:40:55,189 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-02-06 08:40:55,191 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 308 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:55,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1112 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:40:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-06 08:40:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 609. [2025-02-06 08:40:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 597 states have (on average 1.423785594639866) internal successors, (850), 603 states have internal predecessors, (850), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 866 transitions. [2025-02-06 08:40:55,220 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 866 transitions. Word has length 89 [2025-02-06 08:40:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 866 transitions. [2025-02-06 08:40:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:40:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 866 transitions. [2025-02-06 08:40:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:40:55,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:55,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:40:55,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 437567231, now seen corresponding path program 1 times [2025-02-06 08:40:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943813600] [2025-02-06 08:40:55,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:55,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:40:55,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:40:55,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:55,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:40:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943813600] [2025-02-06 08:40:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943813600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999115476] [2025-02-06 08:40:55,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:55,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:55,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:55,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:55,693 INFO L87 Difference]: Start difference. First operand 609 states and 866 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:55,885 INFO L93 Difference]: Finished difference Result 905 states and 1288 transitions. [2025-02-06 08:40:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:40:55,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:40:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:55,890 INFO L225 Difference]: With dead ends: 905 [2025-02-06 08:40:55,891 INFO L226 Difference]: Without dead ends: 885 [2025-02-06 08:40:55,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:55,893 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 455 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:55,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1428 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:40:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-06 08:40:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 611. [2025-02-06 08:40:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 599 states have (on average 1.4223706176961604) internal successors, (852), 605 states have internal predecessors, (852), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 868 transitions. [2025-02-06 08:40:55,921 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 868 transitions. Word has length 104 [2025-02-06 08:40:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:55,923 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 868 transitions. [2025-02-06 08:40:55,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 868 transitions. [2025-02-06 08:40:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:40:55,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:55,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:55,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:40:55,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:55,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -676822247, now seen corresponding path program 1 times [2025-02-06 08:40:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383227905] [2025-02-06 08:40:55,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:55,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:40:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:40:56,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:56,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:40:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383227905] [2025-02-06 08:40:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383227905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:56,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:56,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935612312] [2025-02-06 08:40:56,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:56,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:56,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:56,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:56,184 INFO L87 Difference]: Start difference. First operand 611 states and 868 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:56,302 INFO L93 Difference]: Finished difference Result 904 states and 1292 transitions. [2025-02-06 08:40:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:40:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:40:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:56,306 INFO L225 Difference]: With dead ends: 904 [2025-02-06 08:40:56,306 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 08:40:56,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:56,308 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 23 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:56,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1116 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:40:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 08:40:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2025-02-06 08:40:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 533 states have internal predecessors, (716), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 732 transitions. [2025-02-06 08:40:56,324 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 732 transitions. Word has length 153 [2025-02-06 08:40:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:56,325 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 732 transitions. [2025-02-06 08:40:56,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 732 transitions. [2025-02-06 08:40:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:40:56,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:56,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:56,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:40:56,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1985341050, now seen corresponding path program 1 times [2025-02-06 08:40:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:56,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609945747] [2025-02-06 08:40:56,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:56,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:40:56,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:40:56,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:56,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:40:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609945747] [2025-02-06 08:40:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609945747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:56,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841350546] [2025-02-06 08:40:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:56,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:56,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:56,597 INFO L87 Difference]: Start difference. First operand 539 states and 732 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:56,696 INFO L93 Difference]: Finished difference Result 806 states and 1108 transitions. [2025-02-06 08:40:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:40:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:40:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:56,699 INFO L225 Difference]: With dead ends: 806 [2025-02-06 08:40:56,699 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 08:40:56,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:56,702 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 27 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:56,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1113 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:40:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 08:40:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-02-06 08:40:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 503 states have (on average 1.3479125248508945) internal successors, (678), 509 states have internal predecessors, (678), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 694 transitions. [2025-02-06 08:40:56,718 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 694 transitions. Word has length 153 [2025-02-06 08:40:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:56,719 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 694 transitions. [2025-02-06 08:40:56,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 694 transitions. [2025-02-06 08:40:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:40:56,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:56,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:40:56,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1433803309, now seen corresponding path program 1 times [2025-02-06 08:40:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540511587] [2025-02-06 08:40:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:56,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:40:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:40:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:40:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:56,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540511587] [2025-02-06 08:40:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540511587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857701385] [2025-02-06 08:40:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:56,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:56,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:56,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:56,930 INFO L87 Difference]: Start difference. First operand 515 states and 694 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:57,275 INFO L93 Difference]: Finished difference Result 1102 states and 1496 transitions. [2025-02-06 08:40:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:40:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 153 [2025-02-06 08:40:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:57,282 INFO L225 Difference]: With dead ends: 1102 [2025-02-06 08:40:57,282 INFO L226 Difference]: Without dead ends: 677 [2025-02-06 08:40:57,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:40:57,283 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 822 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:57,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 828 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:40:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-06 08:40:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 647. [2025-02-06 08:40:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 635 states have (on average 1.3480314960629922) internal successors, (856), 641 states have internal predecessors, (856), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:40:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 872 transitions. [2025-02-06 08:40:57,321 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 872 transitions. Word has length 153 [2025-02-06 08:40:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:57,325 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 872 transitions. [2025-02-06 08:40:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 872 transitions. [2025-02-06 08:40:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:40:57,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:57,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:57,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:40:57,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:57,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash 224117925, now seen corresponding path program 1 times [2025-02-06 08:40:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655606944] [2025-02-06 08:40:57,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:57,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:40:57,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:40:57,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:57,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:40:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655606944] [2025-02-06 08:40:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655606944] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:40:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048303764] [2025-02-06 08:40:58,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:58,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:40:58,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:40:58,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:40:58,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:40:58,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:40:58,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:40:58,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:58,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:58,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:40:58,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:40:58,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:40:58,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:40:58,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:40:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:40:58,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:40:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:40:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048303764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:40:58,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:40:58,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-06 08:40:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623975518] [2025-02-06 08:40:58,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:40:58,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:40:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:58,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:40:58,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:40:58,952 INFO L87 Difference]: Start difference. First operand 647 states and 872 transitions. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:40:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:59,447 INFO L93 Difference]: Finished difference Result 2083 states and 2812 transitions. [2025-02-06 08:40:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:40:59,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:40:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:59,453 INFO L225 Difference]: With dead ends: 2083 [2025-02-06 08:40:59,453 INFO L226 Difference]: Without dead ends: 1681 [2025-02-06 08:40:59,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:40:59,454 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1071 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 3390 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:59,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 3390 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:40:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-02-06 08:40:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 989. [2025-02-06 08:40:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 973 states have (on average 1.3442959917780062) internal successors, (1308), 979 states have internal predecessors, (1308), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:40:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1330 transitions. [2025-02-06 08:40:59,488 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1330 transitions. Word has length 163 [2025-02-06 08:40:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:59,488 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1330 transitions. [2025-02-06 08:40:59,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:40:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1330 transitions. [2025-02-06 08:40:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:40:59,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:59,495 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:59,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:40:59,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:40:59,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:59,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1251779332, now seen corresponding path program 1 times [2025-02-06 08:40:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:59,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707875927] [2025-02-06 08:40:59,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:59,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:40:59,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:40:59,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:59,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707875927] [2025-02-06 08:41:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707875927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:41:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860530318] [2025-02-06 08:41:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:02,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:41:02,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:41:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:41:02,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:41:03,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:41:03,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:41:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:03,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:41:03,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:41:03,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:41:03,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:41:03,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:41:03,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:41:03,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:41:03,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:41:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:03,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:41:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:41:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860530318] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:41:03,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:41:03,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-02-06 08:41:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756646657] [2025-02-06 08:41:03,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:41:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 08:41:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:03,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 08:41:03,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-06 08:41:03,995 INFO L87 Difference]: Start difference. First operand 989 states and 1330 transitions. Second operand has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:41:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:04,742 INFO L93 Difference]: Finished difference Result 4114 states and 5569 transitions. [2025-02-06 08:41:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:41:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:41:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:04,757 INFO L225 Difference]: With dead ends: 4114 [2025-02-06 08:41:04,757 INFO L226 Difference]: Without dead ends: 3712 [2025-02-06 08:41:04,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 768 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-06 08:41:04,760 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 4252 mSDsluCounter, 5197 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4282 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:04,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4282 Valid, 5621 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:41:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2025-02-06 08:41:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 1841. [2025-02-06 08:41:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1819 states have (on average 1.3424958768554152) internal successors, (2442), 1825 states have internal predecessors, (2442), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:41:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2476 transitions. [2025-02-06 08:41:04,825 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2476 transitions. Word has length 388 [2025-02-06 08:41:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:04,827 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2476 transitions. [2025-02-06 08:41:04,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:41:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2476 transitions. [2025-02-06 08:41:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:41:04,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:04,840 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:04,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:41:05,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:41:05,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:05,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 324480804, now seen corresponding path program 2 times [2025-02-06 08:41:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:05,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157849141] [2025-02-06 08:41:05,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:41:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:05,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:41:05,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:41:05,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:41:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:41:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:41:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:41:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157849141] [2025-02-06 08:41:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157849141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:41:05,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:41:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:41:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849283079] [2025-02-06 08:41:05,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:41:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:41:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:41:05,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:41:05,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:41:05,466 INFO L87 Difference]: Start difference. First operand 1841 states and 2476 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:41:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:41:05,776 INFO L93 Difference]: Finished difference Result 2255 states and 3041 transitions. [2025-02-06 08:41:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:41:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-06 08:41:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:41:05,785 INFO L225 Difference]: With dead ends: 2255 [2025-02-06 08:41:05,785 INFO L226 Difference]: Without dead ends: 1856 [2025-02-06 08:41:05,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:41:05,787 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 10 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:41:05,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1640 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:41:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2025-02-06 08:41:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1847. [2025-02-06 08:41:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1825 states have (on average 1.3413698630136985) internal successors, (2448), 1831 states have internal predecessors, (2448), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:41:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2482 transitions. [2025-02-06 08:41:05,833 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2482 transitions. Word has length 838 [2025-02-06 08:41:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:41:05,834 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2482 transitions. [2025-02-06 08:41:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:41:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2482 transitions. [2025-02-06 08:41:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:41:05,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:41:05,852 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:41:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:41:05,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:41:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:41:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -865319757, now seen corresponding path program 1 times [2025-02-06 08:41:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:41:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315419981] [2025-02-06 08:41:05,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:41:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:41:06,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes.