./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:17:38,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:17:39,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:17:39,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:17:39,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:17:39,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:17:39,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:17:39,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:17:39,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:17:39,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:17:39,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:17:39,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:17:39,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:17:39,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:17:39,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:17:39,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:17:39,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:17:39,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:17:39,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:17:39,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:17:39,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:17:39,060 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 -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2025-03-08 21:17:39,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:17:39,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:17:39,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:17:39,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:17:39,280 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:17:39,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-08 21:17:40,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88d6ee3c/0dcfcb0b915f40c28c4baa354a4b7e64/FLAG6da71a5df [2025-03-08 21:17:40,736 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:17:40,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-08 21:17:40,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88d6ee3c/0dcfcb0b915f40c28c4baa354a4b7e64/FLAG6da71a5df [2025-03-08 21:17:40,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88d6ee3c/0dcfcb0b915f40c28c4baa354a4b7e64 [2025-03-08 21:17:40,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:17:40,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:17:40,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:17:40,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:17:40,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:17:40,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:17:40" (1/1) ... [2025-03-08 21:17:40,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453ff47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:40, skipping insertion in model container [2025-03-08 21:17:40,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:17:40" (1/1) ... [2025-03-08 21:17:40,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:17:41,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[33021,33034] [2025-03-08 21:17:41,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[84583,84596] [2025-03-08 21:17:41,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:17:41,385 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:17:41,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[33021,33034] [2025-03-08 21:17:41,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[84583,84596] [2025-03-08 21:17:41,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:17:41,510 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:17:41,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41 WrapperNode [2025-03-08 21:17:41,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:17:41,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:17:41,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:17:41,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:17:41,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,658 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-03-08 21:17:41,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:17:41,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:17:41,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:17:41,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:17:41,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,736 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-08 21:17:41,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:17:41,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:17:41,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:17:41,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:17:41,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (1/1) ... [2025-03-08 21:17:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:17:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:17:41,835 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-08 21:17:41,840 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-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:17:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:17:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:17:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:17:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:17:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:17:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:17:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:17:41,993 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:17:41,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:17:43,912 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 21:17:44,112 INFO L? ?]: Removed 797 outVars from TransFormulas that were not future-live. [2025-03-08 21:17:44,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:17:44,170 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:17:44,170 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:17:44,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:17:44 BoogieIcfgContainer [2025-03-08 21:17:44,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:17:44,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:17:44,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:17:44,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:17:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:17:40" (1/3) ... [2025-03-08 21:17:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a16e8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:17:44, skipping insertion in model container [2025-03-08 21:17:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:41" (2/3) ... [2025-03-08 21:17:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a16e8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:17:44, skipping insertion in model container [2025-03-08 21:17:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:17:44" (3/3) ... [2025-03-08 21:17:44,177 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2025-03-08 21:17:44,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:17:44,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 5 procedures, 1374 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-08 21:17:44,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:17:44,265 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;@3458fada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:17:44,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 21:17:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 1366 states, 858 states have (on average 1.8391608391608392) internal successors, (1578), 1360 states have internal predecessors, (1578), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:17:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 21:17:44,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:44,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:44,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:44,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:44,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2075831204, now seen corresponding path program 1 times [2025-03-08 21:17:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884333225] [2025-03-08 21:17:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 21:17:44,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 21:17:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:44,400 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-08 21:17:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884333225] [2025-03-08 21:17:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884333225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:17:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633627606] [2025-03-08 21:17:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:17:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:44,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:17:44,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:17:44,423 INFO L87 Difference]: Start difference. First operand has 1366 states, 858 states have (on average 1.8391608391608392) internal successors, (1578), 1360 states have internal predecessors, (1578), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:17:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:44,621 INFO L93 Difference]: Finished difference Result 2730 states and 5666 transitions. [2025-03-08 21:17:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:17:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 21:17:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:44,648 INFO L225 Difference]: With dead ends: 2730 [2025-03-08 21:17:44,650 INFO L226 Difference]: Without dead ends: 1362 [2025-03-08 21:17:44,661 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-08 21:17:44,663 INFO L435 NwaCegarLoop]: 2487 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2487 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-08 21:17:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-03-08 21:17:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:17:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2524 transitions. [2025-03-08 21:17:44,899 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2524 transitions. Word has length 9 [2025-03-08 21:17:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:44,899 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2524 transitions. [2025-03-08 21:17:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:17:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2524 transitions. [2025-03-08 21:17:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 21:17:44,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:44,901 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] [2025-03-08 21:17:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:17:44,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:44,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash -459533633, now seen corresponding path program 1 times [2025-03-08 21:17:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289661845] [2025-03-08 21:17:44,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:44,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:17:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:17:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:45,272 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-08 21:17:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289661845] [2025-03-08 21:17:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289661845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958262070] [2025-03-08 21:17:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:45,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:45,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:45,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:45,276 INFO L87 Difference]: Start difference. First operand 1362 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 21:17:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:46,100 INFO L93 Difference]: Finished difference Result 3875 states and 7274 transitions. [2025-03-08 21:17:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:17:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-08 21:17:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:46,122 INFO L225 Difference]: With dead ends: 3875 [2025-03-08 21:17:46,122 INFO L226 Difference]: Without dead ends: 2711 [2025-03-08 21:17:46,127 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-08 21:17:46,128 INFO L435 NwaCegarLoop]: 2734 mSDtfsCounter, 1503 mSDsluCounter, 4692 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7426 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:46,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7426 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-08 21:17:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1364. [2025-03-08 21:17:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:17:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-03-08 21:17:46,355 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 62 [2025-03-08 21:17:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-03-08 21:17:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 21:17:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-03-08 21:17:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:17:46,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:46,364 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:17:46,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 96214276, now seen corresponding path program 1 times [2025-03-08 21:17:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108039626] [2025-03-08 21:17:46,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:46,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:17:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:17:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:17:46,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108039626] [2025-03-08 21:17:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108039626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450313493] [2025-03-08 21:17:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:46,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:46,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:46,677 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-08 21:17:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:46,829 INFO L93 Difference]: Finished difference Result 2682 states and 4982 transitions. [2025-03-08 21:17:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:17:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 136 [2025-03-08 21:17:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:46,839 INFO L225 Difference]: With dead ends: 2682 [2025-03-08 21:17:46,839 INFO L226 Difference]: Without dead ends: 1322 [2025-03-08 21:17:46,844 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-08 21:17:46,846 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 30 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7154 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:46,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7154 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-08 21:17:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2025-03-08 21:17:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:17:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2449 transitions. [2025-03-08 21:17:46,951 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2449 transitions. Word has length 136 [2025-03-08 21:17:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:46,951 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2449 transitions. [2025-03-08 21:17:46,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-08 21:17:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2449 transitions. [2025-03-08 21:17:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 21:17:46,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:46,957 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:17:46,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1301483958, now seen corresponding path program 1 times [2025-03-08 21:17:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987373112] [2025-03-08 21:17:46,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:46,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 21:17:47,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 21:17:47,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:47,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:17:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987373112] [2025-03-08 21:17:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987373112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:17:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347005760] [2025-03-08 21:17:47,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:47,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:17:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:17:47,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:17:47,132 INFO L87 Difference]: Start difference. First operand 1322 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-08 21:17:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:47,330 INFO L93 Difference]: Finished difference Result 3861 states and 7214 transitions. [2025-03-08 21:17:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:17:47,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-03-08 21:17:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:47,347 INFO L225 Difference]: With dead ends: 3861 [2025-03-08 21:17:47,348 INFO L226 Difference]: Without dead ends: 2543 [2025-03-08 21:17:47,354 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-08 21:17:47,355 INFO L435 NwaCegarLoop]: 2844 mSDtfsCounter, 1259 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5239 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:47,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5239 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-08 21:17:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2541. [2025-03-08 21:17:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 1534 states have (on average 1.7992177314211213) internal successors, (2760), 2535 states have internal predecessors, (2760), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:17:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4766 transitions. [2025-03-08 21:17:47,597 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4766 transitions. Word has length 136 [2025-03-08 21:17:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:47,599 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4766 transitions. [2025-03-08 21:17:47,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-08 21:17:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4766 transitions. [2025-03-08 21:17:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:17:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:47,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:17:47,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1033108980, now seen corresponding path program 1 times [2025-03-08 21:17:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125045069] [2025-03-08 21:17:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:47,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:17:47,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:17:47,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:17:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125045069] [2025-03-08 21:17:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125045069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561664679] [2025-03-08 21:17:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:47,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:47,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:47,872 INFO L87 Difference]: Start difference. First operand 2541 states and 4766 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-08 21:17:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:48,033 INFO L93 Difference]: Finished difference Result 4754 states and 9072 transitions. [2025-03-08 21:17:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:17:48,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 151 [2025-03-08 21:17:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:48,051 INFO L225 Difference]: With dead ends: 4754 [2025-03-08 21:17:48,052 INFO L226 Difference]: Without dead ends: 2457 [2025-03-08 21:17:48,060 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-08 21:17:48,062 INFO L435 NwaCegarLoop]: 2317 mSDtfsCounter, 30 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6932 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:48,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6932 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-08 21:17:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2025-03-08 21:17:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1450 states have (on average 1.7972413793103448) internal successors, (2606), 2451 states have internal predecessors, (2606), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 21:17:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4612 transitions. [2025-03-08 21:17:48,271 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4612 transitions. Word has length 151 [2025-03-08 21:17:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:48,272 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4612 transitions. [2025-03-08 21:17:48,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-08 21:17:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4612 transitions. [2025-03-08 21:17:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:17:48,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:48,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:48,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:17:48,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1908931917, now seen corresponding path program 1 times [2025-03-08 21:17:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934860234] [2025-03-08 21:17:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:48,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:17:48,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:17:48,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:48,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:17:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934860234] [2025-03-08 21:17:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934860234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:17:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286806437] [2025-03-08 21:17:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:17:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:48,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:17:48,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:17:48,520 INFO L87 Difference]: Start difference. First operand 2457 states and 4612 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-08 21:17:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:50,425 INFO L93 Difference]: Finished difference Result 4903 states and 9209 transitions. [2025-03-08 21:17:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:17:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 151 [2025-03-08 21:17:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:50,441 INFO L225 Difference]: With dead ends: 4903 [2025-03-08 21:17:50,441 INFO L226 Difference]: Without dead ends: 2535 [2025-03-08 21:17:50,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:17:50,449 INFO L435 NwaCegarLoop]: 2669 mSDtfsCounter, 6038 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6539 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1509 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:50,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6539 Valid, 5075 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1509 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 21:17:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2025-03-08 21:17:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1365. [2025-03-08 21:17:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 858 states have (on average 1.724941724941725) internal successors, (1480), 1359 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 21:17:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2486 transitions. [2025-03-08 21:17:50,658 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2486 transitions. Word has length 151 [2025-03-08 21:17:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2486 transitions. [2025-03-08 21:17:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-08 21:17:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2486 transitions. [2025-03-08 21:17:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:17:50,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:50,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:50,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:17:50,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:50,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash -39127009, now seen corresponding path program 1 times [2025-03-08 21:17:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187117686] [2025-03-08 21:17:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:50,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:17:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:17:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:17:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:51,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187117686] [2025-03-08 21:17:51,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187117686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:17:51,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318841203] [2025-03-08 21:17:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:51,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:17:51,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:17:51,190 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-08 21:17:51,192 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-08 21:17:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 21:17:51,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 21:17:51,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:51,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:51,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:17:51,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:17:51,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:17:51,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:17:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:17:51,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:17:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:17:51,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318841203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:17:51,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:17:51,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-08 21:17:51,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993858880] [2025-03-08 21:17:51,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:17:51,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:17:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:51,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:17:51,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:17:51,781 INFO L87 Difference]: Start difference. First operand 1365 states and 2486 transitions. Second operand has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:17:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:56,638 INFO L93 Difference]: Finished difference Result 5202 states and 9606 transitions. [2025-03-08 21:17:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:17:56,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-08 21:17:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:56,658 INFO L225 Difference]: With dead ends: 5202 [2025-03-08 21:17:56,658 INFO L226 Difference]: Without dead ends: 4080 [2025-03-08 21:17:56,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:17:56,662 INFO L435 NwaCegarLoop]: 1984 mSDtfsCounter, 5895 mSDsluCounter, 11420 mSDsCounter, 0 mSdLazyCounter, 5873 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6899 SdHoareTripleChecker+Valid, 13404 SdHoareTripleChecker+Invalid, 6880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 5873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:56,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6899 Valid, 13404 Invalid, 6880 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1007 Valid, 5873 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 21:17:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2025-03-08 21:17:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 1705. [2025-03-08 21:17:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1194 states have (on average 1.6164154103852597) internal successors, (1930), 1695 states have internal predecessors, (1930), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-08 21:17:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2942 transitions. [2025-03-08 21:17:56,973 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2942 transitions. Word has length 161 [2025-03-08 21:17:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:56,973 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2942 transitions. [2025-03-08 21:17:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:17:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2942 transitions. [2025-03-08 21:17:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 21:17:56,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:56,980 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:56,989 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-08 21:17:57,181 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-08 21:17:57,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:17:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -260913792, now seen corresponding path program 1 times [2025-03-08 21:17:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083993874] [2025-03-08 21:17:57,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:17:57,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:17:57,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:17:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083993874] [2025-03-08 21:17:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083993874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:17:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303857627] [2025-03-08 21:17:59,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:17:59,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:17:59,751 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-08 21:17:59,752 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-08 21:18:00,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 21:18:00,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 21:18:00,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:00,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:00,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1865 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 21:18:00,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:18:00,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:18:00,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:00,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:00,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:00,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:18:00,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:18:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:18:01,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303857627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:18:01,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:18:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-03-08 21:18:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424348313] [2025-03-08 21:18:01,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:18:01,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:18:01,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:01,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:18:01,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:18:01,026 INFO L87 Difference]: Start difference. First operand 1705 states and 2942 transitions. Second operand has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:18:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:15,026 INFO L93 Difference]: Finished difference Result 10508 states and 19365 transitions. [2025-03-08 21:18:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 21:18:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 383 [2025-03-08 21:18:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:15,071 INFO L225 Difference]: With dead ends: 10508 [2025-03-08 21:18:15,071 INFO L226 Difference]: Without dead ends: 9386 [2025-03-08 21:18:15,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 754 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-08 21:18:15,077 INFO L435 NwaCegarLoop]: 6747 mSDtfsCounter, 13426 mSDsluCounter, 44496 mSDsCounter, 0 mSdLazyCounter, 26350 mSolverCounterSat, 2518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16436 SdHoareTripleChecker+Valid, 51243 SdHoareTripleChecker+Invalid, 28868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2518 IncrementalHoareTripleChecker+Valid, 26350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:15,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16436 Valid, 51243 Invalid, 28868 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2518 Valid, 26350 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2025-03-08 21:18:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2025-03-08 21:18:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 2551. [2025-03-08 21:18:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2034 states have (on average 1.503441494591937) internal successors, (3058), 2535 states have internal predecessors, (3058), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:18:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4082 transitions. [2025-03-08 21:18:15,806 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4082 transitions. Word has length 383 [2025-03-08 21:18:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:15,807 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4082 transitions. [2025-03-08 21:18:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 21:18:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4082 transitions. [2025-03-08 21:18:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-08 21:18:15,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:15,818 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:18:15,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:18:16,018 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-08 21:18:16,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash -835450622, now seen corresponding path program 2 times [2025-03-08 21:18:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319756978] [2025-03-08 21:18:16,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:18:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:16,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-08 21:18:16,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-08 21:18:16,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:18:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:18:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319756978] [2025-03-08 21:18:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319756978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:18:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755961761] [2025-03-08 21:18:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:18:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:16,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:18:16,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:18:16,481 INFO L87 Difference]: Start difference. First operand 2551 states and 4082 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-08 21:18:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:16,845 INFO L93 Difference]: Finished difference Result 3712 states and 6297 transitions. [2025-03-08 21:18:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:18:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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 827 [2025-03-08 21:18:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:16,855 INFO L225 Difference]: With dead ends: 3712 [2025-03-08 21:18:16,855 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 21:18:16,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:18:16,859 INFO L435 NwaCegarLoop]: 2342 mSDtfsCounter, 80 mSDsluCounter, 9115 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11457 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:16,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11457 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:18:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 21:18:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2553. [2025-03-08 21:18:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2036 states have (on average 1.5029469548133596) internal successors, (3060), 2537 states have internal predecessors, (3060), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:18:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4084 transitions. [2025-03-08 21:18:17,059 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4084 transitions. Word has length 827 [2025-03-08 21:18:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4084 transitions. [2025-03-08 21:18:17,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-08 21:18:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4084 transitions. [2025-03-08 21:18:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-08 21:18:17,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:17,075 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:18:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:18:17,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1303641079, now seen corresponding path program 1 times [2025-03-08 21:18:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024779350] [2025-03-08 21:18:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:17,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-08 21:18:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-08 21:18:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:17,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-08 21:18:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024779350] [2025-03-08 21:18:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024779350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:18,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:18:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170090424] [2025-03-08 21:18:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:18,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:18:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:18,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:18:18,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:18:18,955 INFO L87 Difference]: Start difference. First operand 2553 states and 4084 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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-08 21:18:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:19,292 INFO L93 Difference]: Finished difference Result 3681 states and 6253 transitions. [2025-03-08 21:18:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:18:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 828 [2025-03-08 21:18:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:19,301 INFO L225 Difference]: With dead ends: 3681 [2025-03-08 21:18:19,301 INFO L226 Difference]: Without dead ends: 2558 [2025-03-08 21:18:19,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:18:19,305 INFO L435 NwaCegarLoop]: 2322 mSDtfsCounter, 14 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11342 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:19,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11342 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:18:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-08 21:18:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2557. [2025-03-08 21:18:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2040 states have (on average 1.5024509803921569) internal successors, (3065), 2541 states have internal predecessors, (3065), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-08 21:18:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4089 transitions. [2025-03-08 21:18:19,530 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4089 transitions. Word has length 828 [2025-03-08 21:18:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:19,532 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4089 transitions. [2025-03-08 21:18:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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-08 21:18:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4089 transitions. [2025-03-08 21:18:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 21:18:19,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:19,543 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:18:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:18:19,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1919784912, now seen corresponding path program 1 times [2025-03-08 21:18:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438510358] [2025-03-08 21:18:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:19,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:18:20,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:18:20,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:20,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:18:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438510358] [2025-03-08 21:18:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438510358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:18:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276095972] [2025-03-08 21:18:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:18:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:26,974 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-08 21:18:26,975 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-08 21:18:27,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 21:18:27,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 21:18:27,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:27,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:27,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 4081 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 21:18:27,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:18:27,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:18:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 21:18:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:18:28,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:18:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:18:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276095972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:18:29,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:18:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 42 [2025-03-08 21:18:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568148834] [2025-03-08 21:18:29,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:18:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 21:18:29,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 21:18:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 21:18:29,553 INFO L87 Difference]: Start difference. First operand 2557 states and 4089 transitions. Second operand has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)