./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_SFH_test5-2.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 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:19:30,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:19:30,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:19:30,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:19:30,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:19:30,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:19:30,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:19:30,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:19:30,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:19:30,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:19:30,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:19:30,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:19:30,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:19:30,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:19:30,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:19:30,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:19:30,655 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 -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2025-03-04 06:19:30,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:19:30,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:19:30,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:19:30,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:19:30,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:19:30,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2025-03-04 06:19:32,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a6df546/79f4b982b344479d8a4a977487a9e8af/FLAG153c23858 [2025-03-04 06:19:32,359 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:19:32,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2025-03-04 06:19:32,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a6df546/79f4b982b344479d8a4a977487a9e8af/FLAG153c23858 [2025-03-04 06:19:32,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a6df546/79f4b982b344479d8a4a977487a9e8af [2025-03-04 06:19:32,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:19:32,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:19:32,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:19:32,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:19:32,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:19:32,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:19:32" (1/1) ... [2025-03-04 06:19:32,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6e5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:32, skipping insertion in model container [2025-03-04 06:19:32,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:19:32" (1/1) ... [2025-03-04 06:19:32,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:19:32,951 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_SFH_test5-2.i[33021,33034] [2025-03-04 06:19:33,057 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_SFH_test5-2.i[49681,49694] [2025-03-04 06:19:33,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:19:33,081 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:19:33,111 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_SFH_test5-2.i[33021,33034] [2025-03-04 06:19:33,169 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_SFH_test5-2.i[49681,49694] [2025-03-04 06:19:33,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:19:33,210 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:19:33,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33 WrapperNode [2025-03-04 06:19:33,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:19:33,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:19:33,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:19:33,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:19:33,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,296 INFO L138 Inliner]: procedures = 177, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2133 [2025-03-04 06:19:33,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:19:33,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:19:33,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:19:33,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:19:33,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,417 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [2, 24, 371]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 91 writes are split as follows [0, 1, 90]. [2025-03-04 06:19:33,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,467 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:19:33,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:19:33,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:19:33,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:19:33,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (1/1) ... [2025-03-04 06:19:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:19:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:33,529 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-04 06:19:33,531 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-04 06:19:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:19:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:19:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:19:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:19:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:19:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:19:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:19:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:19:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:19:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:19:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:19:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:19:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:19:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:19:33,776 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:19:33,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:19:35,194 INFO L1325 $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-04 06:19:35,312 INFO L? ?]: Removed 508 outVars from TransFormulas that were not future-live. [2025-03-04 06:19:35,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:19:35,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:19:35,367 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 06:19:35,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:19:35 BoogieIcfgContainer [2025-03-04 06:19:35,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:19:35,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:19:35,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:19:35,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:19:35,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:19:32" (1/3) ... [2025-03-04 06:19:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430e5ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:19:35, skipping insertion in model container [2025-03-04 06:19:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:33" (2/3) ... [2025-03-04 06:19:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430e5ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:19:35, skipping insertion in model container [2025-03-04 06:19:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:19:35" (3/3) ... [2025-03-04 06:19:35,378 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-2.i [2025-03-04 06:19:35,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:19:35,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-2.i that has 5 procedures, 600 locations, 1 initial locations, 51 loop locations, and 2 error locations. [2025-03-04 06:19:35,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:19:35,461 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;@1c948384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:19:35,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:19:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 592 states, 576 states have (on average 1.6215277777777777) internal successors, (934), 583 states have internal predecessors, (934), 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-04 06:19:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 06:19:35,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:35,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:35,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:35,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1040065711, now seen corresponding path program 1 times [2025-03-04 06:19:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:35,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694929340] [2025-03-04 06:19:35,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 06:19:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 06:19:35,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:35,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:35,610 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-04 06:19:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694929340] [2025-03-04 06:19:35,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694929340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:35,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:35,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:19:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14654331] [2025-03-04 06:19:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:35,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:19:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:19:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:19:35,632 INFO L87 Difference]: Start difference. First operand has 592 states, 576 states have (on average 1.6215277777777777) internal successors, (934), 583 states have internal predecessors, (934), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:35,786 INFO L93 Difference]: Finished difference Result 1182 states and 1915 transitions. [2025-03-04 06:19:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:19:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 06:19:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:35,801 INFO L225 Difference]: With dead ends: 1182 [2025-03-04 06:19:35,802 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 06:19:35,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:19:35,810 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:35,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 06:19:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-04 06:19:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 541 states have (on average 1.465804066543438) internal successors, (793), 547 states have internal predecessors, (793), 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-04 06:19:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 815 transitions. [2025-03-04 06:19:35,858 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 815 transitions. Word has length 7 [2025-03-04 06:19:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:35,859 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 815 transitions. [2025-03-04 06:19:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 815 transitions. [2025-03-04 06:19:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 06:19:35,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:35,861 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] [2025-03-04 06:19:35,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:19:35,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1590768374, now seen corresponding path program 1 times [2025-03-04 06:19:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196199571] [2025-03-04 06:19:35,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:35,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:19:35,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:19:35,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:36,106 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-04 06:19:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:36,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196199571] [2025-03-04 06:19:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196199571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:36,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:36,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:19:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974992449] [2025-03-04 06:19:36,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:19:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:19:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:19:36,110 INFO L87 Difference]: Start difference. First operand 556 states and 815 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04 06:19:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:36,308 INFO L93 Difference]: Finished difference Result 1272 states and 1875 transitions. [2025-03-04 06:19:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:19:36,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2025-03-04 06:19:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:36,313 INFO L225 Difference]: With dead ends: 1272 [2025-03-04 06:19:36,314 INFO L226 Difference]: Without dead ends: 1100 [2025-03-04 06:19:36,315 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-04 06:19:36,315 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 779 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1499 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:19:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-03-04 06:19:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 557. [2025-03-04 06:19:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 542 states have (on average 1.4649446494464944) internal successors, (794), 548 states have internal predecessors, (794), 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-04 06:19:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 816 transitions. [2025-03-04 06:19:36,354 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 816 transitions. Word has length 59 [2025-03-04 06:19:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 816 transitions. [2025-03-04 06:19:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04 06:19:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 816 transitions. [2025-03-04 06:19:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 06:19:36,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:36,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:36,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:19:36,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:36,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1157410012, now seen corresponding path program 1 times [2025-03-04 06:19:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041689623] [2025-03-04 06:19:36,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 06:19:36,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 06:19:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:36,840 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-04 06:19:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041689623] [2025-03-04 06:19:36,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041689623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:36,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:36,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778829515] [2025-03-04 06:19:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:36,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:36,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:36,843 INFO L87 Difference]: Start difference. First operand 557 states and 816 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-04 06:19:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:37,021 INFO L93 Difference]: Finished difference Result 1114 states and 1632 transitions. [2025-03-04 06:19:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:19:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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 201 [2025-03-04 06:19:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:37,024 INFO L225 Difference]: With dead ends: 1114 [2025-03-04 06:19:37,024 INFO L226 Difference]: Without dead ends: 560 [2025-03-04 06:19:37,025 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-04 06:19:37,026 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 105 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2091 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:37,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2091 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-04 06:19:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 557. [2025-03-04 06:19:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 542 states have (on average 1.452029520295203) internal successors, (787), 548 states have internal predecessors, (787), 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-04 06:19:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 809 transitions. [2025-03-04 06:19:37,039 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 809 transitions. Word has length 201 [2025-03-04 06:19:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:37,039 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 809 transitions. [2025-03-04 06:19:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-04 06:19:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 809 transitions. [2025-03-04 06:19:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 06:19:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:37,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:19:37,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -956385757, now seen corresponding path program 1 times [2025-03-04 06:19:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551312904] [2025-03-04 06:19:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:37,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 06:19:37,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 06:19:37,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:37,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:37,289 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-04 06:19:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551312904] [2025-03-04 06:19:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551312904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:37,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:19:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329439490] [2025-03-04 06:19:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:37,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:19:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:37,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:19:37,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:19:37,291 INFO L87 Difference]: Start difference. First operand 557 states and 809 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-04 06:19:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:37,445 INFO L93 Difference]: Finished difference Result 1238 states and 1802 transitions. [2025-03-04 06:19:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:19:37,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 201 [2025-03-04 06:19:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:37,448 INFO L225 Difference]: With dead ends: 1238 [2025-03-04 06:19:37,448 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 06:19:37,449 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-04 06:19:37,450 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 134 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1481 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-04 06:19:37,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1481 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 06:19:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-04 06:19:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 669 states have (on average 1.45440956651719) internal successors, (973), 675 states have internal predecessors, (973), 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-04 06:19:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 995 transitions. [2025-03-04 06:19:37,473 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 995 transitions. Word has length 201 [2025-03-04 06:19:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 995 transitions. [2025-03-04 06:19:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-04 06:19:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 995 transitions. [2025-03-04 06:19:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 06:19:37,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:37,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:19:37,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 131351494, now seen corresponding path program 1 times [2025-03-04 06:19:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576122065] [2025-03-04 06:19:37,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:37,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:19:37,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:19:37,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:37,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:37,876 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-04 06:19:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576122065] [2025-03-04 06:19:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576122065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016339640] [2025-03-04 06:19:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:37,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:37,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:37,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:37,881 INFO L87 Difference]: Start difference. First operand 684 states and 995 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-04 06:19:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:38,028 INFO L93 Difference]: Finished difference Result 1196 states and 1735 transitions. [2025-03-04 06:19:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:19:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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 216 [2025-03-04 06:19:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:38,031 INFO L225 Difference]: With dead ends: 1196 [2025-03-04 06:19:38,031 INFO L226 Difference]: Without dead ends: 642 [2025-03-04 06:19:38,032 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-04 06:19:38,033 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 30 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1940 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-04 06:19:38,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1940 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-04 06:19:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2025-03-04 06:19:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 627 states have (on average 1.4290271132376395) internal successors, (896), 633 states have internal predecessors, (896), 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-04 06:19:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 918 transitions. [2025-03-04 06:19:38,046 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 918 transitions. Word has length 216 [2025-03-04 06:19:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:38,046 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 918 transitions. [2025-03-04 06:19:38,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-04 06:19:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 918 transitions. [2025-03-04 06:19:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 06:19:38,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:38,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:19:38,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:38,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -651268160, now seen corresponding path program 1 times [2025-03-04 06:19:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689045592] [2025-03-04 06:19:38,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:19:38,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:19:38,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:38,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:38,308 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-04 06:19:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689045592] [2025-03-04 06:19:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689045592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:19:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459697185] [2025-03-04 06:19:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:19:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:38,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:19:38,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:19:38,311 INFO L87 Difference]: Start difference. First operand 642 states and 918 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-04 06:19:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:38,501 INFO L93 Difference]: Finished difference Result 1442 states and 2064 transitions. [2025-03-04 06:19:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:19:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 216 [2025-03-04 06:19:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:38,507 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 06:19:38,507 INFO L226 Difference]: Without dead ends: 930 [2025-03-04 06:19:38,508 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-04 06:19:38,510 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 452 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1501 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:38,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1501 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:19:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-04 06:19:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 928. [2025-03-04 06:19:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 905 states have (on average 1.4298342541436464) internal successors, (1294), 916 states have internal predecessors, (1294), 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-04 06:19:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1332 transitions. [2025-03-04 06:19:38,540 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1332 transitions. Word has length 216 [2025-03-04 06:19:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:38,542 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1332 transitions. [2025-03-04 06:19:38,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-04 06:19:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1332 transitions. [2025-03-04 06:19:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-04 06:19:38,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:38,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:38,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:19:38,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2079046224, now seen corresponding path program 1 times [2025-03-04 06:19:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839179280] [2025-03-04 06:19:38,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:38,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:19:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:19:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:38,866 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-04 06:19:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839179280] [2025-03-04 06:19:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839179280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505534581] [2025-03-04 06:19:38,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:38,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:38,870 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-04 06:19:38,871 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-04 06:19:39,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:19:39,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:19:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:39,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:19:39,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:39,355 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-04 06:19:39,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:19:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505534581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:19:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 06:19:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160545842] [2025-03-04 06:19:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:39,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:39,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:19:39,357 INFO L87 Difference]: Start difference. First operand 928 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-04 06:19:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:39,516 INFO L93 Difference]: Finished difference Result 1249 states and 1814 transitions. [2025-03-04 06:19:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:19:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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 231 [2025-03-04 06:19:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:39,521 INFO L225 Difference]: With dead ends: 1249 [2025-03-04 06:19:39,521 INFO L226 Difference]: Without dead ends: 934 [2025-03-04 06:19:39,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 230 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-04 06:19:39,523 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 105 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1848 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-04 06:19:39,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1848 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-04 06:19:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 928. [2025-03-04 06:19:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 905 states have (on average 1.4143646408839778) internal successors, (1280), 916 states have internal predecessors, (1280), 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-04 06:19:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1318 transitions. [2025-03-04 06:19:39,554 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1318 transitions. Word has length 231 [2025-03-04 06:19:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1318 transitions. [2025-03-04 06:19:39,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-04 06:19:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1318 transitions. [2025-03-04 06:19:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-04 06:19:39,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:39,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:39,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:39,758 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-04 06:19:39,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1340098135, now seen corresponding path program 1 times [2025-03-04 06:19:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667648374] [2025-03-04 06:19:39,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:39,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:19:39,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:19:39,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:40,065 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-04 06:19:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667648374] [2025-03-04 06:19:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667648374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399106635] [2025-03-04 06:19:40,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:40,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:40,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:40,067 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-04 06:19:40,069 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-04 06:19:40,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:19:40,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:19:40,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:40,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:40,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:19:40,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:40,692 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-04 06:19:40,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:40,885 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-04 06:19:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399106635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:40,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 06:19:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057851823] [2025-03-04 06:19:40,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:40,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:19:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:40,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:19:40,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:19:40,887 INFO L87 Difference]: Start difference. First operand 928 states and 1318 transitions. Second operand has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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-04 06:19:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:41,214 INFO L93 Difference]: Finished difference Result 2469 states and 3530 transitions. [2025-03-04 06:19:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:19:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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 231 [2025-03-04 06:19:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:41,223 INFO L225 Difference]: With dead ends: 2469 [2025-03-04 06:19:41,223 INFO L226 Difference]: Without dead ends: 2154 [2025-03-04 06:19:41,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 459 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-04 06:19:41,225 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 2927 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:41,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 2727 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:19:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2025-03-04 06:19:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1662. [2025-03-04 06:19:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1624 states have (on average 1.396551724137931) internal successors, (2268), 1635 states have internal predecessors, (2268), 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-04 06:19:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2336 transitions. [2025-03-04 06:19:41,272 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2336 transitions. Word has length 231 [2025-03-04 06:19:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:41,273 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2336 transitions. [2025-03-04 06:19:41,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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-04 06:19:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2336 transitions. [2025-03-04 06:19:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-04 06:19:41,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:41,282 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, 1] [2025-03-04 06:19:41,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:41,482 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-04 06:19:41,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash 398329310, now seen corresponding path program 1 times [2025-03-04 06:19:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016209325] [2025-03-04 06:19:41,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-04 06:19:41,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-04 06:19:41,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:41,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:42,266 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-04 06:19:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016209325] [2025-03-04 06:19:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016209325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65858287] [2025-03-04 06:19:42,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:42,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:42,269 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-04 06:19:42,271 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-04 06:19:42,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-04 06:19:43,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-04 06:19:43,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:43,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 3246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:19:43,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:43,762 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-04 06:19:43,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:44,308 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-04 06:19:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65858287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:44,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-04 06:19:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43191247] [2025-03-04 06:19:44,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:44,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 06:19:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:44,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 06:19:44,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:19:44,313 INFO L87 Difference]: Start difference. First operand 1662 states and 2336 transitions. Second operand has 14 states, 14 states have (on average 110.64285714285714) internal successors, (1549), 14 states have internal predecessors, (1549), 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-04 06:19:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:47,612 INFO L93 Difference]: Finished difference Result 5337 states and 7543 transitions. [2025-03-04 06:19:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:19:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 110.64285714285714) internal successors, (1549), 14 states have internal predecessors, (1549), 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 657 [2025-03-04 06:19:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:47,629 INFO L225 Difference]: With dead ends: 5337 [2025-03-04 06:19:47,629 INFO L226 Difference]: Without dead ends: 4284 [2025-03-04 06:19:47,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1328 GetRequests, 1304 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-04 06:19:47,634 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 15087 mSDsluCounter, 5209 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15087 SdHoareTripleChecker+Valid, 6162 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:47,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15087 Valid, 6162 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 06:19:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2025-03-04 06:19:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3454. [2025-03-04 06:19:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3403 states have (on average 1.3893623273582134) internal successors, (4728), 3409 states have internal predecessors, (4728), 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-04 06:19:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4822 transitions. [2025-03-04 06:19:47,711 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4822 transitions. Word has length 657 [2025-03-04 06:19:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:47,713 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 4822 transitions. [2025-03-04 06:19:47,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.64285714285714) internal successors, (1549), 14 states have internal predecessors, (1549), 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-04 06:19:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4822 transitions. [2025-03-04 06:19:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1520 [2025-03-04 06:19:47,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:47,760 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, 1] [2025-03-04 06:19:47,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:19:47,961 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-04 06:19:47,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -478812486, now seen corresponding path program 1 times [2025-03-04 06:19:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115007970] [2025-03-04 06:19:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:48,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1519 statements into 1 equivalence classes.