./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:24:07,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:24:07,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:24:07,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:24:07,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:24:07,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:24:07,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:24:07,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:24:07,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:24:07,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:24:07,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:24:07,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:24:07,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:24:07,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:24:07,163 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:24:07,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:24:07,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:07,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:24:07,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:24:07,165 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2025-03-17 10:24:07,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:24:07,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:24:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:24:07,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:24:07,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:24:07,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-03-17 10:24:08,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35997b2/c2d3056ba61f42f5b8209bee298ab774/FLAG3d4f19714 [2025-03-17 10:24:08,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:24:08,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-03-17 10:24:09,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35997b2/c2d3056ba61f42f5b8209bee298ab774/FLAG3d4f19714 [2025-03-17 10:24:09,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35997b2/c2d3056ba61f42f5b8209bee298ab774 [2025-03-17 10:24:09,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:24:09,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:24:09,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:09,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:24:09,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:24:09,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c5bc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09, skipping insertion in model container [2025-03-17 10:24:09,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:24:09,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[33021,33034] [2025-03-17 10:24:09,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[49681,49694] [2025-03-17 10:24:09,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:09,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:24:09,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[33021,33034] [2025-03-17 10:24:09,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i[49681,49694] [2025-03-17 10:24:09,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:09,637 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:24:09,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09 WrapperNode [2025-03-17 10:24:09,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:09,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:09,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:24:09,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:24:09,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,738 INFO L138 Inliner]: procedures = 177, calls = 373, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-03-17 10:24:09,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:09,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:24:09,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:24:09,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:24:09,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,859 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-03-17 10:24:09,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:24:09,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:24:09,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:24:09,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:24:09,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (1/1) ... [2025-03-17 10:24:09,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:10,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:24:10,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:24:10,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:10,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:24:10,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:24:10,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:24:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:24:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:24:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:24:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:24:10,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:24:10,250 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:24:10,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:24:11,785 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 10:24:11,921 INFO L? ?]: Removed 482 outVars from TransFormulas that were not future-live. [2025-03-17 10:24:11,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:24:11,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:24:11,981 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:24:11,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:11 BoogieIcfgContainer [2025-03-17 10:24:11,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:24:11,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:24:11,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:24:11,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:24:11,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:24:09" (1/3) ... [2025-03-17 10:24:11,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc5910f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:11, skipping insertion in model container [2025-03-17 10:24:11,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:09" (2/3) ... [2025-03-17 10:24:11,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc5910f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:11, skipping insertion in model container [2025-03-17 10:24:11,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:11" (3/3) ... [2025-03-17 10:24:11,989 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2025-03-17 10:24:12,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:24:12,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-1.i that has 5 procedures, 565 locations, 1 initial locations, 46 loop locations, and 2 error locations. [2025-03-17 10:24:12,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:24:12,074 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;@607f19f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:24:12,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:24:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 557 states, 541 states have (on average 1.6229205175600738) internal successors, (878), 548 states have internal predecessors, (878), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 10:24:12,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:12,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 10:24:12,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:12,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1077795921, now seen corresponding path program 1 times [2025-03-17 10:24:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992253126] [2025-03-17 10:24:12,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 10:24:12,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 10:24:12,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:24:12,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992253126] [2025-03-17 10:24:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992253126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:12,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706035176] [2025-03-17 10:24:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:12,284 INFO L87 Difference]: Start difference. First operand has 557 states, 541 states have (on average 1.6229205175600738) internal successors, (878), 548 states have internal predecessors, (878), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-17 10:24:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:12,572 INFO L93 Difference]: Finished difference Result 1656 states and 2696 transitions. [2025-03-17 10:24:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:12,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-17 10:24:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:12,588 INFO L225 Difference]: With dead ends: 1656 [2025-03-17 10:24:12,589 INFO L226 Difference]: Without dead ends: 1097 [2025-03-17 10:24:12,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:12,600 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 778 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:12,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1492 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-03-17 10:24:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 555. [2025-03-17 10:24:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 540 states have (on average 1.4666666666666666) internal successors, (792), 546 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 814 transitions. [2025-03-17 10:24:12,692 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 814 transitions. Word has length 6 [2025-03-17 10:24:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 814 transitions. [2025-03-17 10:24:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-17 10:24:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 814 transitions. [2025-03-17 10:24:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:24:12,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:12,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:12,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:24:12,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:12,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 737862267, now seen corresponding path program 1 times [2025-03-17 10:24:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199237932] [2025-03-17 10:24:12,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:24:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:24:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:12,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:24:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199237932] [2025-03-17 10:24:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199237932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:24:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147767452] [2025-03-17 10:24:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:13,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:13,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:13,342 INFO L87 Difference]: Start difference. First operand 555 states and 814 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-03-17 10:24:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:13,537 INFO L93 Difference]: Finished difference Result 1128 states and 1656 transitions. [2025-03-17 10:24:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 200 [2025-03-17 10:24:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:13,541 INFO L225 Difference]: With dead ends: 1128 [2025-03-17 10:24:13,542 INFO L226 Difference]: Without dead ends: 575 [2025-03-17 10:24:13,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:13,544 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 8 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:13,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1445 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-17 10:24:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-03-17 10:24:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 560 states have (on average 1.45) internal successors, (812), 566 states have internal predecessors, (812), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 834 transitions. [2025-03-17 10:24:13,574 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 834 transitions. Word has length 200 [2025-03-17 10:24:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:13,575 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 834 transitions. [2025-03-17 10:24:13,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-03-17 10:24:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 834 transitions. [2025-03-17 10:24:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:24:13,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:13,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:13,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:24:13,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1861081670, now seen corresponding path program 1 times [2025-03-17 10:24:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325894366] [2025-03-17 10:24:13,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:13,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:24:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:24:13,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:13,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:24:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325894366] [2025-03-17 10:24:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325894366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715856085] [2025-03-17 10:24:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:13,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:13,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:13,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:13,955 INFO L87 Difference]: Start difference. First operand 575 states and 834 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-03-17 10:24:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:14,174 INFO L93 Difference]: Finished difference Result 1134 states and 1652 transitions. [2025-03-17 10:24:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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 200 [2025-03-17 10:24:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:14,178 INFO L225 Difference]: With dead ends: 1134 [2025-03-17 10:24:14,178 INFO L226 Difference]: Without dead ends: 561 [2025-03-17 10:24:14,179 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-03-17 10:24:14,181 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 105 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:14,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2085 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-17 10:24:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-17 10:24:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4487179487179487) internal successors, (791), 552 states have internal predecessors, (791), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 813 transitions. [2025-03-17 10:24:14,200 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 813 transitions. Word has length 200 [2025-03-17 10:24:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:14,201 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 813 transitions. [2025-03-17 10:24:14,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-03-17 10:24:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 813 transitions. [2025-03-17 10:24:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:24:14,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:14,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:14,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:24:14,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:14,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 320089857, now seen corresponding path program 1 times [2025-03-17 10:24:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:14,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694966214] [2025-03-17 10:24:14,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:24:14,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:24:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:14,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:24:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694966214] [2025-03-17 10:24:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694966214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:14,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:14,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934849940] [2025-03-17 10:24:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:14,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:14,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:14,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:14,444 INFO L87 Difference]: Start difference. First operand 561 states and 813 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-03-17 10:24:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:14,597 INFO L93 Difference]: Finished difference Result 1253 states and 1817 transitions. [2025-03-17 10:24:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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 200 [2025-03-17 10:24:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:14,601 INFO L225 Difference]: With dead ends: 1253 [2025-03-17 10:24:14,602 INFO L226 Difference]: Without dead ends: 694 [2025-03-17 10:24:14,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:14,603 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 134 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:14,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1477 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-17 10:24:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-17 10:24:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 679 states have (on average 1.4477172312223858) internal successors, (983), 685 states have internal predecessors, (983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1005 transitions. [2025-03-17 10:24:14,626 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1005 transitions. Word has length 200 [2025-03-17 10:24:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:14,626 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1005 transitions. [2025-03-17 10:24:14,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-03-17 10:24:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1005 transitions. [2025-03-17 10:24:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 10:24:14,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:14,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:24:14,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 894164400, now seen corresponding path program 1 times [2025-03-17 10:24:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:14,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414714956] [2025-03-17 10:24:14,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 10:24:14,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 10:24:14,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:14,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:24:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414714956] [2025-03-17 10:24:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414714956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106526166] [2025-03-17 10:24:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:15,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:15,044 INFO L87 Difference]: Start difference. First operand 694 states and 1005 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-17 10:24:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:15,212 INFO L93 Difference]: Finished difference Result 1211 states and 1750 transitions. [2025-03-17 10:24:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:24:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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 215 [2025-03-17 10:24:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:15,216 INFO L225 Difference]: With dead ends: 1211 [2025-03-17 10:24:15,217 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 10:24:15,219 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-03-17 10:24:15,220 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 30 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:15,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1934 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 10:24:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-03-17 10:24:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 637 states have (on average 1.4222919937205651) internal successors, (906), 643 states have internal predecessors, (906), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:24:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 928 transitions. [2025-03-17 10:24:15,237 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 928 transitions. Word has length 215 [2025-03-17 10:24:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:15,237 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 928 transitions. [2025-03-17 10:24:15,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-17 10:24:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 928 transitions. [2025-03-17 10:24:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 10:24:15,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:15,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:15,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:24:15,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2092706825, now seen corresponding path program 1 times [2025-03-17 10:24:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318267630] [2025-03-17 10:24:15,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:15,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 10:24:15,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 10:24:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:24:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318267630] [2025-03-17 10:24:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318267630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:24:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494658109] [2025-03-17 10:24:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:15,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:15,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:24:15,505 INFO L87 Difference]: Start difference. First operand 652 states and 928 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-03-17 10:24:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:15,683 INFO L93 Difference]: Finished difference Result 1456 states and 2078 transitions. [2025-03-17 10:24:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 215 [2025-03-17 10:24:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:15,690 INFO L225 Difference]: With dead ends: 1456 [2025-03-17 10:24:15,690 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 10:24:15,691 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-03-17 10:24:15,693 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 451 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:15,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1498 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 10:24:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2025-03-17 10:24:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 914 states have (on average 1.425601750547046) internal successors, (1303), 925 states have internal predecessors, (1303), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:24:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1341 transitions. [2025-03-17 10:24:15,724 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1341 transitions. Word has length 215 [2025-03-17 10:24:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:15,725 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1341 transitions. [2025-03-17 10:24:15,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-03-17 10:24:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1341 transitions. [2025-03-17 10:24:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 10:24:15,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:15,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:24:15,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash -363631475, now seen corresponding path program 1 times [2025-03-17 10:24:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895437675] [2025-03-17 10:24:15,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:15,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:15,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:15,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:15,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895437675] [2025-03-17 10:24:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895437675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971805492] [2025-03-17 10:24:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:16,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:24:16,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:24:16,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:16,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:16,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:16,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:24:16,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 10:24:16,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:24:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971805492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:16,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:24:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 10:24:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299297363] [2025-03-17 10:24:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:16,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:24:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:16,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:24:16,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:24:16,590 INFO L87 Difference]: Start difference. First operand 937 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:24:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:16,745 INFO L93 Difference]: Finished difference Result 1290 states and 1875 transitions. [2025-03-17 10:24:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:24:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 230 [2025-03-17 10:24:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:16,751 INFO L225 Difference]: With dead ends: 1290 [2025-03-17 10:24:16,752 INFO L226 Difference]: Without dead ends: 977 [2025-03-17 10:24:16,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:24:16,753 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 8 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:16,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1283 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-17 10:24:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-17 10:24:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 954 states have (on average 1.4077568134171907) internal successors, (1343), 965 states have internal predecessors, (1343), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:24:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1381 transitions. [2025-03-17 10:24:16,784 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1381 transitions. Word has length 230 [2025-03-17 10:24:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:16,784 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1381 transitions. [2025-03-17 10:24:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:24:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1381 transitions. [2025-03-17 10:24:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 10:24:16,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:16,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:16,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:24:16,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:16,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:16,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash 661062446, now seen corresponding path program 1 times [2025-03-17 10:24:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361035589] [2025-03-17 10:24:16,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:17,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361035589] [2025-03-17 10:24:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361035589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333180485] [2025-03-17 10:24:17,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:17,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:17,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:17,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:24:17,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:24:17,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:17,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:17,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:24:17,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 10:24:17,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:24:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333180485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:17,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:24:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 10:24:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858370343] [2025-03-17 10:24:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:17,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:17,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:17,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:17,816 INFO L87 Difference]: Start difference. First operand 977 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:24:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:17,994 INFO L93 Difference]: Finished difference Result 1302 states and 1867 transitions. [2025-03-17 10:24:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 230 [2025-03-17 10:24:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:17,998 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 10:24:17,998 INFO L226 Difference]: Without dead ends: 949 [2025-03-17 10:24:17,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:18,000 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 105 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:18,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1842 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-17 10:24:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2025-03-17 10:24:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 926 states have (on average 1.4049676025917928) internal successors, (1301), 937 states have internal predecessors, (1301), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:24:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1339 transitions. [2025-03-17 10:24:18,022 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1339 transitions. Word has length 230 [2025-03-17 10:24:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:18,024 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1339 transitions. [2025-03-17 10:24:18,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:24:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1339 transitions. [2025-03-17 10:24:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 10:24:18,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:18,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:18,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:24:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 10:24:18,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1536885383, now seen corresponding path program 1 times [2025-03-17 10:24:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554938701] [2025-03-17 10:24:18,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554938701] [2025-03-17 10:24:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554938701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109607179] [2025-03-17 10:24:18,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:18,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:24:18,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:24:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:24:18,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:24:18,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:18,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:18,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:24:18,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:19,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109607179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:19,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:24:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375233390] [2025-03-17 10:24:19,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:19,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:24:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:19,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:24:19,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:19,316 INFO L87 Difference]: Start difference. First operand 949 states and 1339 transitions. Second operand has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:24:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:19,713 INFO L93 Difference]: Finished difference Result 2526 states and 3587 transitions. [2025-03-17 10:24:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:24:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 230 [2025-03-17 10:24:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:19,721 INFO L225 Difference]: With dead ends: 2526 [2025-03-17 10:24:19,721 INFO L226 Difference]: Without dead ends: 2201 [2025-03-17 10:24:19,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:19,723 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 2183 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:19,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 3184 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2025-03-17 10:24:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1695. [2025-03-17 10:24:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1657 states have (on average 1.3886541943270971) internal successors, (2301), 1668 states have internal predecessors, (2301), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 10:24:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2369 transitions. [2025-03-17 10:24:19,768 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2369 transitions. Word has length 230 [2025-03-17 10:24:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:19,768 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2369 transitions. [2025-03-17 10:24:19,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:24:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2369 transitions. [2025-03-17 10:24:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-17 10:24:19,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:19,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:19,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 10:24:19,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:19,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:19,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -434411972, now seen corresponding path program 1 times [2025-03-17 10:24:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446003406] [2025-03-17 10:24:19,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:20,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-17 10:24:20,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-17 10:24:20,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:20,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 4 proven. 357 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-17 10:24:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446003406] [2025-03-17 10:24:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446003406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:24:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718443107] [2025-03-17 10:24:20,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:20,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:20,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:20,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:24:20,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:24:21,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-17 10:24:21,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-17 10:24:21,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:21,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:21,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 3246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:24:21,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:24:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:22,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:24:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:24:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718443107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:24:22,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:24:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-17 10:24:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179892298] [2025-03-17 10:24:22,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:24:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:24:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:22,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:24:22,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:24:22,948 INFO L87 Difference]: Start difference. First operand 1695 states and 2369 transitions. Second operand has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:24:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:25,998 INFO L93 Difference]: Finished difference Result 5448 states and 7654 transitions. [2025-03-17 10:24:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 10:24:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 656 [2025-03-17 10:24:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:26,017 INFO L225 Difference]: With dead ends: 5448 [2025-03-17 10:24:26,017 INFO L226 Difference]: Without dead ends: 4373 [2025-03-17 10:24:26,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1302 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:24:26,021 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 15343 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15343 SdHoareTripleChecker+Valid, 6174 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15343 Valid, 6174 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 10:24:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2025-03-17 10:24:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 3518. [2025-03-17 10:24:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 3467 states have (on average 1.3821747908854918) internal successors, (4792), 3473 states have internal predecessors, (4792), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 10:24:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 4886 transitions. [2025-03-17 10:24:26,126 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 4886 transitions. Word has length 656 [2025-03-17 10:24:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:26,127 INFO L471 AbstractCegarLoop]: Abstraction has 3518 states and 4886 transitions. [2025-03-17 10:24:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:24:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 4886 transitions. [2025-03-17 10:24:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1519 [2025-03-17 10:24:26,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:26,167 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:26,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 10:24:26,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:24:26,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:24:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1508611480, now seen corresponding path program 1 times [2025-03-17 10:24:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:26,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218071254] [2025-03-17 10:24:26,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:26,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1518 statements into 1 equivalence classes.