./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:19:08,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:19:08,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:19:08,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:19:08,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:19:08,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:19:08,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:19:08,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:19:08,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:19:08,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:19:08,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:19:08,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:19:08,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:19:08,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:19:08,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:19:08,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:19:08,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:19:08,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:19:08,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:19:08,689 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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2025-03-04 06:19:08,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:19:08,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:19:08,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:19:08,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:19:08,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:19:08,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2025-03-04 06:19:10,051 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f42a526/f5a238bd02314fc2a6ac7681120fcd64/FLAG02a91d600 [2025-03-04 06:19:10,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:19:10,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2025-03-04 06:19:10,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f42a526/f5a238bd02314fc2a6ac7681120fcd64/FLAG02a91d600 [2025-03-04 06:19:10,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f42a526/f5a238bd02314fc2a6ac7681120fcd64 [2025-03-04 06:19:10,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:19:10,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:19:10,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:19:10,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:19:10,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:19:10,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:19:10" (1/1) ... [2025-03-04 06:19:10,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:10, skipping insertion in model container [2025-03-04 06:19:10,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:19:10" (1/1) ... [2025-03-04 06:19:10,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:19:10,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i[33021,33034] [2025-03-04 06:19:11,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i[44590,44603] [2025-03-04 06:19:11,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:19:11,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:19:11,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i[33021,33034] [2025-03-04 06:19:11,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i[44590,44603] [2025-03-04 06:19:11,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:19:11,202 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:19:11,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11 WrapperNode [2025-03-04 06:19:11,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:19:11,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:19:11,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:19:11,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:19:11,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,276 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1569 [2025-03-04 06:19:11,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:19:11,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:19:11,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:19:11,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:19:11,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,358 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-04 06:19:11,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:19:11,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:19:11,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:19:11,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:19:11,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (1/1) ... [2025-03-04 06:19:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:19:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:11,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:19:11,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:19:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:19:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:19:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:19:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:19:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:19:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:19:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:19:11,662 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:19:11,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:19:12,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 06:19:12,936 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-03-04 06:19:12,937 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:19:13,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:19:13,000 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:19:13,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:19:13 BoogieIcfgContainer [2025-03-04 06:19:13,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:19:13,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:19:13,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:19:13,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:19:13,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:19:10" (1/3) ... [2025-03-04 06:19:13,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be28ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:19:13, skipping insertion in model container [2025-03-04 06:19:13,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:19:11" (2/3) ... [2025-03-04 06:19:13,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be28ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:19:13, skipping insertion in model container [2025-03-04 06:19:13,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:19:13" (3/3) ... [2025-03-04 06:19:13,009 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-2.i [2025-03-04 06:19:13,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:19:13,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test3-2.i that has 5 procedures, 446 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-04 06:19:13,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:19:13,088 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;@c9866b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:19:13,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:19:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 438 states, 425 states have (on average 1.6235294117647059) internal successors, (690), 432 states have internal predecessors, (690), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 06:19:13,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:13,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:13,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1484408463, now seen corresponding path program 1 times [2025-03-04 06:19:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:13,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214370992] [2025-03-04 06:19:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 06:19:13,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 06:19:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:19:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214370992] [2025-03-04 06:19:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214370992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:19:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025729848] [2025-03-04 06:19:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:19:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:13,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:19:13,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:19:13,241 INFO L87 Difference]: Start difference. First operand has 438 states, 425 states have (on average 1.6235294117647059) internal successors, (690), 432 states have internal predecessors, (690), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:13,343 INFO L93 Difference]: Finished difference Result 874 states and 1415 transitions. [2025-03-04 06:19:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:19:13,345 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-04 06:19:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:13,354 INFO L225 Difference]: With dead ends: 874 [2025-03-04 06:19:13,355 INFO L226 Difference]: Without dead ends: 402 [2025-03-04 06:19:13,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:19:13,363 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:13,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-04 06:19:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-04 06:19:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 390 states have (on average 1.458974358974359) internal successors, (569), 396 states have internal predecessors, (569), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 585 transitions. [2025-03-04 06:19:13,415 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 585 transitions. Word has length 9 [2025-03-04 06:19:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 585 transitions. [2025-03-04 06:19:13,415 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-04 06:19:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 585 transitions. [2025-03-04 06:19:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 06:19:13,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:13,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:13,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:19:13,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1748765296, now seen corresponding path program 1 times [2025-03-04 06:19:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360107727] [2025-03-04 06:19:13,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:19:13,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:19:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:13,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:19:13,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:13,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360107727] [2025-03-04 06:19:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360107727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:13,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563817526] [2025-03-04 06:19:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:13,601 INFO L87 Difference]: Start difference. First operand 402 states and 585 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:13,863 INFO L93 Difference]: Finished difference Result 995 states and 1457 transitions. [2025-03-04 06:19:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:19:13,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 06:19:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:13,869 INFO L225 Difference]: With dead ends: 995 [2025-03-04 06:19:13,869 INFO L226 Difference]: Without dead ends: 791 [2025-03-04 06:19:13,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:13,872 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 554 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:13,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1567 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:19:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-04 06:19:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 404. [2025-03-04 06:19:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2025-03-04 06:19:13,900 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 14 [2025-03-04 06:19:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2025-03-04 06:19:13,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2025-03-04 06:19:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 06:19:13,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:13,903 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] [2025-03-04 06:19:13,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:19:13,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:13,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash -835734922, now seen corresponding path program 1 times [2025-03-04 06:19:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:13,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259778769] [2025-03-04 06:19:13,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:13,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:19:13,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:19:13,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:13,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:14,348 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-04 06:19:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:14,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259778769] [2025-03-04 06:19:14,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259778769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:14,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:14,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:19:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011004303] [2025-03-04 06:19:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:14,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:19:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:14,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:19:14,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:14,352 INFO L87 Difference]: Start difference. First operand 404 states and 587 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:14,519 INFO L93 Difference]: Finished difference Result 762 states and 1104 transitions. [2025-03-04 06:19:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:19:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-04 06:19:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:14,521 INFO L225 Difference]: With dead ends: 762 [2025-03-04 06:19:14,521 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 06:19:14,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:14,522 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 12 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:14,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1773 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 06:19:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-04 06:19:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 1.4114285714285715) internal successors, (494), 356 states have internal predecessors, (494), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 510 transitions. [2025-03-04 06:19:14,533 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 510 transitions. Word has length 88 [2025-03-04 06:19:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 510 transitions. [2025-03-04 06:19:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 510 transitions. [2025-03-04 06:19:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 06:19:14,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:14,535 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] [2025-03-04 06:19:14,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:19:14,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2046230844, now seen corresponding path program 1 times [2025-03-04 06:19:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062069774] [2025-03-04 06:19:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:19:14,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:19:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:14,692 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-04 06:19:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062069774] [2025-03-04 06:19:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062069774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:19:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135074144] [2025-03-04 06:19:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:19:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:14,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:19:14,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:19:14,694 INFO L87 Difference]: Start difference. First operand 362 states and 510 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:14,847 INFO L93 Difference]: Finished difference Result 980 states and 1396 transitions. [2025-03-04 06:19:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:19:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-04 06:19:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:14,851 INFO L225 Difference]: With dead ends: 980 [2025-03-04 06:19:14,851 INFO L226 Difference]: Without dead ends: 622 [2025-03-04 06:19:14,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:19:14,852 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 307 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:14,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1107 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-04 06:19:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 605. [2025-03-04 06:19:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 593 states have (on average 1.4266441821247893) internal successors, (846), 599 states have internal predecessors, (846), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 862 transitions. [2025-03-04 06:19:14,873 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 862 transitions. Word has length 88 [2025-03-04 06:19:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:14,873 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 862 transitions. [2025-03-04 06:19:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:19:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 862 transitions. [2025-03-04 06:19:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:19:14,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:14,879 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] [2025-03-04 06:19:14,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:19:14,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:14,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1148654668, now seen corresponding path program 1 times [2025-03-04 06:19:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:14,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233972130] [2025-03-04 06:19:14,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:19:15,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:19:15,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:15,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:15,290 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-04 06:19:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233972130] [2025-03-04 06:19:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233972130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:15,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510319856] [2025-03-04 06:19:15,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:15,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:15,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:15,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:15,293 INFO L87 Difference]: Start difference. First operand 605 states and 862 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:19:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:15,468 INFO L93 Difference]: Finished difference Result 900 states and 1283 transitions. [2025-03-04 06:19:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:19:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 06:19:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:15,474 INFO L225 Difference]: With dead ends: 900 [2025-03-04 06:19:15,474 INFO L226 Difference]: Without dead ends: 880 [2025-03-04 06:19:15,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:15,475 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 453 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:15,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1344 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-04 06:19:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 607. [2025-03-04 06:19:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 595 states have (on average 1.4252100840336135) internal successors, (848), 601 states have internal predecessors, (848), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 864 transitions. [2025-03-04 06:19:15,501 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 864 transitions. Word has length 103 [2025-03-04 06:19:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:15,502 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 864 transitions. [2025-03-04 06:19:15,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:19:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 864 transitions. [2025-03-04 06:19:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:19:15,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:15,503 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-04 06:19:15,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:19:15,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash -45646911, now seen corresponding path program 1 times [2025-03-04 06:19:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586125201] [2025-03-04 06:19:15,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:19:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:19:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:15,764 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-04 06:19:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586125201] [2025-03-04 06:19:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586125201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008918367] [2025-03-04 06:19:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:15,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:15,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:15,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:15,767 INFO L87 Difference]: Start difference. First operand 607 states and 864 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-04 06:19:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:15,879 INFO L93 Difference]: Finished difference Result 898 states and 1286 transitions. [2025-03-04 06:19:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:19:15,879 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-04 06:19:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:15,882 INFO L225 Difference]: With dead ends: 898 [2025-03-04 06:19:15,882 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 06:19:15,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:15,883 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 23 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:15,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1110 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 06:19:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2025-03-04 06:19:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 523 states have (on average 1.3613766730401529) internal successors, (712), 529 states have internal predecessors, (712), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 728 transitions. [2025-03-04 06:19:15,901 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 728 transitions. Word has length 151 [2025-03-04 06:19:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:15,902 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 728 transitions. [2025-03-04 06:19:15,902 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-04 06:19:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 728 transitions. [2025-03-04 06:19:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:19:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:15,905 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-04 06:19:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:19:15,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1678450910, now seen corresponding path program 1 times [2025-03-04 06:19:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242100863] [2025-03-04 06:19:15,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:15,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:19:15,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:19:15,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:15,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:16,146 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-04 06:19:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242100863] [2025-03-04 06:19:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242100863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136559032] [2025-03-04 06:19:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:16,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:16,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:16,148 INFO L87 Difference]: Start difference. First operand 535 states and 728 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-04 06:19:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:16,260 INFO L93 Difference]: Finished difference Result 800 states and 1102 transitions. [2025-03-04 06:19:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:19:16,261 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-04 06:19:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:16,263 INFO L225 Difference]: With dead ends: 800 [2025-03-04 06:19:16,263 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 06:19:16,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:16,264 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 27 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:16,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1107 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:19:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 06:19:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-04 06:19:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 499 states have (on average 1.3507014028056112) internal successors, (674), 505 states have internal predecessors, (674), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 690 transitions. [2025-03-04 06:19:16,276 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 690 transitions. Word has length 151 [2025-03-04 06:19:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:16,277 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 690 transitions. [2025-03-04 06:19:16,277 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-04 06:19:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 690 transitions. [2025-03-04 06:19:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:19:16,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:16,278 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-04 06:19:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:19:16,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:16,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -802627973, now seen corresponding path program 1 times [2025-03-04 06:19:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708526515] [2025-03-04 06:19:16,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:19:16,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:19:16,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:16,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:16,490 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-04 06:19:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708526515] [2025-03-04 06:19:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708526515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:19:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004346099] [2025-03-04 06:19:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:16,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:19:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:16,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:19:16,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:19:16,493 INFO L87 Difference]: Start difference. First operand 511 states and 690 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-04 06:19:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:16,996 INFO L93 Difference]: Finished difference Result 1094 states and 1488 transitions. [2025-03-04 06:19:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:19:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-04 06:19:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:17,000 INFO L225 Difference]: With dead ends: 1094 [2025-03-04 06:19:17,000 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 06:19:17,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:19:17,002 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 819 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:17,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 822 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:19:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 06:19:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 642. [2025-03-04 06:19:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 630 states have (on average 1.3507936507936509) internal successors, (851), 636 states have internal predecessors, (851), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 06:19:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2025-03-04 06:19:17,021 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 151 [2025-03-04 06:19:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2025-03-04 06:19:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 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-04 06:19:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2025-03-04 06:19:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 06:19:17,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:17,024 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-04 06:19:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:19:17,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:17,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2001073331, now seen corresponding path program 1 times [2025-03-04 06:19:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750608659] [2025-03-04 06:19:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:19:17,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:19:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:17,586 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-04 06:19:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750608659] [2025-03-04 06:19:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750608659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071048676] [2025-03-04 06:19:17,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:17,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:17,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:19:17,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:19:17,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:19:17,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:19:17,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:17,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:17,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:19:17,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:17,917 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-04 06:19:18,072 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-04 06:19:18,085 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-04 06:19:18,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:18,241 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-04 06:19:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071048676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:18,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-04 06:19:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063530577] [2025-03-04 06:19:18,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:19:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:18,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:19:18,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:18,243 INFO L87 Difference]: Start difference. First operand 642 states and 867 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-04 06:19:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:18,610 INFO L93 Difference]: Finished difference Result 2068 states and 2797 transitions. [2025-03-04 06:19:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:19:18,611 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-04 06:19:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:18,616 INFO L225 Difference]: With dead ends: 2068 [2025-03-04 06:19:18,616 INFO L226 Difference]: Without dead ends: 1669 [2025-03-04 06:19:18,617 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-04 06:19:18,618 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1730 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:18,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2992 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:19:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-04 06:19:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 982. [2025-03-04 06:19:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 966 states have (on average 1.3467908902691512) internal successors, (1301), 972 states have internal predecessors, (1301), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 06:19:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1323 transitions. [2025-03-04 06:19:18,648 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1323 transitions. Word has length 161 [2025-03-04 06:19:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1323 transitions. [2025-03-04 06:19:18,648 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-04 06:19:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1323 transitions. [2025-03-04 06:19:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-04 06:19:18,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:18,652 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-04 06:19:18,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:18,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:18,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1472042321, now seen corresponding path program 1 times [2025-03-04 06:19:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244418600] [2025-03-04 06:19:18,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:18,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:19:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:19:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:21,307 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-04 06:19:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244418600] [2025-03-04 06:19:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244418600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537168317] [2025-03-04 06:19:21,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:21,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:19:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:19:21,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:19:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:19:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:21,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 06:19:21,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:21,850 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-04 06:19:21,988 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-04 06:19:22,083 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-04 06:19:22,207 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-04 06:19:22,312 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-04 06:19:22,329 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-04 06:19:22,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:22,806 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-04 06:19:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537168317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:22,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-03-04 06:19:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292747011] [2025-03-04 06:19:22,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:19:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:22,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:19:22,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:19:22,810 INFO L87 Difference]: Start difference. First operand 982 states and 1323 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-04 06:19:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:24,225 INFO L93 Difference]: Finished difference Result 4084 states and 5539 transitions. [2025-03-04 06:19:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:19:24,226 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-04 06:19:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:24,239 INFO L225 Difference]: With dead ends: 4084 [2025-03-04 06:19:24,239 INFO L226 Difference]: Without dead ends: 3685 [2025-03-04 06:19:24,243 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-04 06:19:24,243 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 4194 mSDsluCounter, 15062 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 16455 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:24,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4224 Valid, 16455 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:19:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-03-04 06:19:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 1828. [2025-03-04 06:19:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1806 states have (on average 1.3449612403100775) internal successors, (2429), 1812 states have internal predecessors, (2429), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 06:19:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2463 transitions. [2025-03-04 06:19:24,317 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2463 transitions. Word has length 383 [2025-03-04 06:19:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2463 transitions. [2025-03-04 06:19:24,319 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-04 06:19:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2463 transitions. [2025-03-04 06:19:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-04 06:19:24,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:24,331 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-04 06:19:24,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:24,531 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,SelfDestructingSolverStorable9 [2025-03-04 06:19:24,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1071993767, now seen corresponding path program 2 times [2025-03-04 06:19:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55359836] [2025-03-04 06:19:24,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:19:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:24,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-04 06:19:24,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-04 06:19:24,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:19:24,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:24,885 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-04 06:19:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55359836] [2025-03-04 06:19:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55359836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:24,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:19:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138675500] [2025-03-04 06:19:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:24,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:19:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:24,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:19:24,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:19:24,887 INFO L87 Difference]: Start difference. First operand 1828 states and 2463 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-04 06:19:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:25,195 INFO L93 Difference]: Finished difference Result 2325 states and 3144 transitions. [2025-03-04 06:19:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:25,196 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-04 06:19:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:25,202 INFO L225 Difference]: With dead ends: 2325 [2025-03-04 06:19:25,202 INFO L226 Difference]: Without dead ends: 1929 [2025-03-04 06:19:25,203 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-04 06:19:25,205 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 76 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:25,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1746 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:19:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-03-04 06:19:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1834. [2025-03-04 06:19:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1812 states have (on average 1.3438189845474613) internal successors, (2435), 1818 states have internal predecessors, (2435), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 06:19:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2469 transitions. [2025-03-04 06:19:25,246 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2469 transitions. Word has length 827 [2025-03-04 06:19:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:25,246 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2469 transitions. [2025-03-04 06:19:25,247 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-04 06:19:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2469 transitions. [2025-03-04 06:19:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-04 06:19:25,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:25,262 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-04 06:19:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:19:25,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1734231956, now seen corresponding path program 1 times [2025-03-04 06:19:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738433463] [2025-03-04 06:19:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:25,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-04 06:19:25,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-04 06:19:25,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:25,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:27,404 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-04 06:19:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738433463] [2025-03-04 06:19:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738433463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:19:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979252479] [2025-03-04 06:19:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:19:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:19:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:19:27,406 INFO L87 Difference]: Start difference. First operand 1834 states and 2469 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-04 06:19:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:27,725 INFO L93 Difference]: Finished difference Result 2251 states and 3037 transitions. [2025-03-04 06:19:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:19:27,726 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-04 06:19:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:27,733 INFO L225 Difference]: With dead ends: 2251 [2025-03-04 06:19:27,733 INFO L226 Difference]: Without dead ends: 1849 [2025-03-04 06:19:27,735 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-04 06:19:27,736 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 10 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:27,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1631 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:19:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-03-04 06:19:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1846. [2025-03-04 06:19:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1824 states have (on average 1.343201754385965) internal successors, (2450), 1830 states have internal predecessors, (2450), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 06:19:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2484 transitions. [2025-03-04 06:19:27,790 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2484 transitions. Word has length 828 [2025-03-04 06:19:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2484 transitions. [2025-03-04 06:19:27,791 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-04 06:19:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2484 transitions. [2025-03-04 06:19:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-04 06:19:27,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:27,802 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-04 06:19:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:19:27,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1604571321, now seen corresponding path program 1 times [2025-03-04 06:19:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425026220] [2025-03-04 06:19:27,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:28,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes.