./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:35:21,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:35:21,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:35:21,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:35:21,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:35:21,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:35:21,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:35:21,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:35:21,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:35:21,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:35:21,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:35:21,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:35:21,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:35:21,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:35:21,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:35:21,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:21,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:35:21,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:35:21,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:35:21,558 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 -> 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 [2025-03-17 10:35:21,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:35:21,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:35:21,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:35:21,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:35:21,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:35:21,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2025-03-17 10:35:22,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6462fe5dc/f46b5547c3014d0c9b2cea342d1e442a/FLAG16044721f [2025-03-17 10:35:23,330 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:35:23,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2025-03-17 10:35:23,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6462fe5dc/f46b5547c3014d0c9b2cea342d1e442a/FLAG16044721f [2025-03-17 10:35:23,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6462fe5dc/f46b5547c3014d0c9b2cea342d1e442a [2025-03-17 10:35:23,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:35:23,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:35:23,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:23,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:35:23,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:35:23,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:23,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcacdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23, skipping insertion in model container [2025-03-17 10:35:23,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:23,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:35:23,698 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_SAX_test7-1.i[33021,33034] [2025-03-17 10:35:23,797 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_SAX_test7-1.i[44124,44137] [2025-03-17 10:35:23,798 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_SAX_test7-1.i[44245,44258] [2025-03-17 10:35:23,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:23,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:35:23,854 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_SAX_test7-1.i[33021,33034] [2025-03-17 10:35:23,907 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_SAX_test7-1.i[44124,44137] [2025-03-17 10:35:23,907 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_SAX_test7-1.i[44245,44258] [2025-03-17 10:35:23,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:23,936 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:35:23,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23 WrapperNode [2025-03-17 10:35:23,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:23,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:23,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:35:23,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:35:23,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:23,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,033 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1378 [2025-03-17 10:35:24,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:24,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:35:24,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:35:24,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:35:24,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,109 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-03-17 10:35:24,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:35:24,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:35:24,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:35:24,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:35:24,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (1/1) ... [2025-03-17 10:35:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:24,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:35:24,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:35:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:35:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:35:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:35:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:35:24,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:35:24,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:35:24,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:35:25,499 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: 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-17 10:35:25,572 INFO L? ?]: Removed 311 outVars from TransFormulas that were not future-live. [2025-03-17 10:35:25,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:35:25,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:35:25,621 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:35:25,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:25 BoogieIcfgContainer [2025-03-17 10:35:25,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:35:25,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:35:25,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:35:25,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:35:25,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:35:23" (1/3) ... [2025-03-17 10:35:25,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a1959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:25, skipping insertion in model container [2025-03-17 10:35:25,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:23" (2/3) ... [2025-03-17 10:35:25,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a1959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:25, skipping insertion in model container [2025-03-17 10:35:25,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:25" (3/3) ... [2025-03-17 10:35:25,630 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-1.i [2025-03-17 10:35:25,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:35:25,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test7-1.i that has 4 procedures, 396 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-17 10:35:25,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:35:25,700 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;@2487b7b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:35:25,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:35:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 381 states have (on average 1.6246719160104988) internal successors, (619), 383 states have internal predecessors, (619), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:35:25,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:25,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:25,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:25,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1426167181, now seen corresponding path program 1 times [2025-03-17 10:35:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127205794] [2025-03-17 10:35:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:25,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:35:25,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:35:25,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:25,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:35:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:25,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127205794] [2025-03-17 10:35:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127205794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535964398] [2025-03-17 10:35:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:25,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:35:25,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:25,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:35:25,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:35:25,864 INFO L87 Difference]: Start difference. First operand has 388 states, 381 states have (on average 1.6246719160104988) internal successors, (619), 383 states have internal predecessors, (619), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:25,973 INFO L93 Difference]: Finished difference Result 775 states and 1249 transitions. [2025-03-17 10:35:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:35:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 10:35:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:25,981 INFO L225 Difference]: With dead ends: 775 [2025-03-17 10:35:25,981 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:35:25,984 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-17 10:35:25,985 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:25,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:35:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:35:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 1.4564643799472297) internal successors, (552), 380 states have internal predecessors, (552), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 558 transitions. [2025-03-17 10:35:26,025 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 558 transitions. Word has length 7 [2025-03-17 10:35:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:26,026 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 558 transitions. [2025-03-17 10:35:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 558 transitions. [2025-03-17 10:35:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:35:26,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:26,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:26,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:35:26,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:26,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:26,027 INFO L85 PathProgramCache]: Analyzing trace with hash 731280288, now seen corresponding path program 1 times [2025-03-17 10:35:26,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:26,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952087136] [2025-03-17 10:35:26,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:26,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:26,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:35:26,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:35:26,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:26,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:35:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952087136] [2025-03-17 10:35:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952087136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:35:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086342374] [2025-03-17 10:35:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:26,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:26,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:26,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:26,179 INFO L87 Difference]: Start difference. First operand 385 states and 558 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:35:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:26,400 INFO L93 Difference]: Finished difference Result 952 states and 1383 transitions. [2025-03-17 10:35:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:35:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:35:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:26,406 INFO L225 Difference]: With dead ends: 952 [2025-03-17 10:35:26,406 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 10:35:26,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:26,408 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 543 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:26,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1485 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 10:35:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 387. [2025-03-17 10:35:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 381 states have (on average 1.4540682414698163) internal successors, (554), 382 states have internal predecessors, (554), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 560 transitions. [2025-03-17 10:35:26,439 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 560 transitions. Word has length 9 [2025-03-17 10:35:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:26,439 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 560 transitions. [2025-03-17 10:35:26,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-17 10:35:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 560 transitions. [2025-03-17 10:35:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:35:26,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:26,442 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] [2025-03-17 10:35:26,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:35:26,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash -512132827, now seen corresponding path program 1 times [2025-03-17 10:35:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456384324] [2025-03-17 10:35:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:26,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:35:26,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:35:26,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:26,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:26,816 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-17 10:35:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456384324] [2025-03-17 10:35:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456384324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462644919] [2025-03-17 10:35:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:26,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:26,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:26,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:26,818 INFO L87 Difference]: Start difference. First operand 387 states and 560 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:26,958 INFO L93 Difference]: Finished difference Result 729 states and 1051 transitions. [2025-03-17 10:35:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:35:26,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-17 10:35:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:26,960 INFO L225 Difference]: With dead ends: 729 [2025-03-17 10:35:26,960 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 10:35:26,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:26,961 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 30 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:26,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1253 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 10:35:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 10:35:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.407079646017699) internal successors, (477), 340 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2025-03-17 10:35:26,970 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 83 [2025-03-17 10:35:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:26,971 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2025-03-17 10:35:26,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2025-03-17 10:35:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:35:26,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:26,973 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] [2025-03-17 10:35:26,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:35:26,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash -842971732, now seen corresponding path program 1 times [2025-03-17 10:35:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:26,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380373811] [2025-03-17 10:35:26,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:27,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:35:27,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:35:27,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:27,176 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-17 10:35:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380373811] [2025-03-17 10:35:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380373811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:27,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879989166] [2025-03-17 10:35:27,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:27,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:27,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:27,177 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:27,343 INFO L93 Difference]: Finished difference Result 934 states and 1320 transitions. [2025-03-17 10:35:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2025-03-17 10:35:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:27,346 INFO L225 Difference]: With dead ends: 934 [2025-03-17 10:35:27,346 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 10:35:27,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:27,347 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 293 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:27,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1026 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 10:35:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2025-03-17 10:35:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.4243986254295533) internal successors, (829), 583 states have internal predecessors, (829), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-03-17 10:35:27,369 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 83 [2025-03-17 10:35:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:27,369 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-03-17 10:35:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-03-17 10:35:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:35:27,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:27,372 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] [2025-03-17 10:35:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:35:27,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:27,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash -594064213, now seen corresponding path program 1 times [2025-03-17 10:35:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182365107] [2025-03-17 10:35:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:27,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:35:27,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:35:27,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:27,758 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-17 10:35:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182365107] [2025-03-17 10:35:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182365107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:27,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148611287] [2025-03-17 10:35:27,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:27,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:27,760 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:27,921 INFO L93 Difference]: Finished difference Result 867 states and 1230 transitions. [2025-03-17 10:35:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:35:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-03-17 10:35:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:27,926 INFO L225 Difference]: With dead ends: 867 [2025-03-17 10:35:27,926 INFO L226 Difference]: Without dead ends: 863 [2025-03-17 10:35:27,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:27,927 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:27,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1341 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-17 10:35:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 590. [2025-03-17 10:35:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 584 states have (on average 1.422945205479452) internal successors, (831), 585 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 837 transitions. [2025-03-17 10:35:27,941 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 837 transitions. Word has length 98 [2025-03-17 10:35:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:27,942 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 837 transitions. [2025-03-17 10:35:27,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 837 transitions. [2025-03-17 10:35:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:35:27,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:27,945 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] [2025-03-17 10:35:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:35:27,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:27,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash -371245653, now seen corresponding path program 1 times [2025-03-17 10:35:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616414264] [2025-03-17 10:35:27,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:27,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:35:28,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:35:28,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:28,231 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-17 10:35:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616414264] [2025-03-17 10:35:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616414264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:28,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799895448] [2025-03-17 10:35:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:28,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:28,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:28,233 INFO L87 Difference]: Start difference. First operand 590 states and 837 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:28,348 INFO L93 Difference]: Finished difference Result 851 states and 1213 transitions. [2025-03-17 10:35:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:35:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 150 [2025-03-17 10:35:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:28,350 INFO L225 Difference]: With dead ends: 851 [2025-03-17 10:35:28,352 INFO L226 Difference]: Without dead ends: 506 [2025-03-17 10:35:28,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:28,353 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 30 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:28,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1031 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-17 10:35:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-17 10:35:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 500 states have (on average 1.354) internal successors, (677), 501 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 683 transitions. [2025-03-17 10:35:28,371 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 683 transitions. Word has length 150 [2025-03-17 10:35:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 683 transitions. [2025-03-17 10:35:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 683 transitions. [2025-03-17 10:35:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:35:28,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:28,374 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] [2025-03-17 10:35:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:35:28,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -957002715, now seen corresponding path program 1 times [2025-03-17 10:35:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335726018] [2025-03-17 10:35:28,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:35:28,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:35:28,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:28,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:28,604 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-17 10:35:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335726018] [2025-03-17 10:35:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335726018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:35:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160239471] [2025-03-17 10:35:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:28,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:35:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:28,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:35:28,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:28,606 INFO L87 Difference]: Start difference. First operand 506 states and 683 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-17 10:35:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:29,015 INFO L93 Difference]: Finished difference Result 1264 states and 1708 transitions. [2025-03-17 10:35:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:35:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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 150 [2025-03-17 10:35:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:29,018 INFO L225 Difference]: With dead ends: 1264 [2025-03-17 10:35:29,018 INFO L226 Difference]: Without dead ends: 846 [2025-03-17 10:35:29,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:29,019 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1098 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:29,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1270 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:35:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-17 10:35:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 643. [2025-03-17 10:35:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 637 states have (on average 1.3563579277864992) internal successors, (864), 638 states have internal predecessors, (864), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:35:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 870 transitions. [2025-03-17 10:35:29,038 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 870 transitions. Word has length 150 [2025-03-17 10:35:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:29,038 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 870 transitions. [2025-03-17 10:35:29,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-17 10:35:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 870 transitions. [2025-03-17 10:35:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:35:29,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:29,040 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] [2025-03-17 10:35:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:35:29,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash 58697879, now seen corresponding path program 1 times [2025-03-17 10:35:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941695250] [2025-03-17 10:35:29,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:35:29,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:35:29,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:29,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:29,670 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-17 10:35:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941695250] [2025-03-17 10:35:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941695250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525332137] [2025-03-17 10:35:29,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:29,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:29,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:35:29,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:35:29,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:35:30,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:35:30,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:30,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:30,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:35:30,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:30,058 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-17 10:35:30,253 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-17 10:35:30,300 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-17 10:35:30,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:35:30,464 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-17 10:35:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525332137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:35:30,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:35:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-17 10:35:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454267843] [2025-03-17 10:35:30,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:35:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:35:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:30,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:35:30,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:35:30,467 INFO L87 Difference]: Start difference. First operand 643 states and 870 transitions. Second operand has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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-17 10:35:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:30,990 INFO L93 Difference]: Finished difference Result 2881 states and 3907 transitions. [2025-03-17 10:35:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:35:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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 160 [2025-03-17 10:35:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:30,999 INFO L225 Difference]: With dead ends: 2881 [2025-03-17 10:35:30,999 INFO L226 Difference]: Without dead ends: 2480 [2025-03-17 10:35:31,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 312 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-17 10:35:31,001 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 2218 mSDsluCounter, 4412 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 5096 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:31,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 5096 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:35:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2025-03-17 10:35:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 983. [2025-03-17 10:35:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 973 states have (on average 1.3504624871531345) internal successors, (1314), 974 states have internal predecessors, (1314), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 10:35:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1326 transitions. [2025-03-17 10:35:31,044 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1326 transitions. Word has length 160 [2025-03-17 10:35:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:31,044 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1326 transitions. [2025-03-17 10:35:31,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.5) internal successors, (318), 12 states have internal predecessors, (318), 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-17 10:35:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1326 transitions. [2025-03-17 10:35:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-17 10:35:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:31,051 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] [2025-03-17 10:35:31,060 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-17 10:35:31,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:31,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash -504283781, now seen corresponding path program 1 times [2025-03-17 10:35:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60494743] [2025-03-17 10:35:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:35:31,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:35:31,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:31,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:33,707 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-17 10:35:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60494743] [2025-03-17 10:35:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60494743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478811022] [2025-03-17 10:35:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:33,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:33,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:33,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:35:33,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:35:34,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-17 10:35:34,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-17 10:35:34,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:34,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:34,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 10:35:34,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:34,259 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-17 10:35:34,435 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-17 10:35:34,536 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-17 10:35:34,633 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-17 10:35:34,738 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-17 10:35:34,752 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-17 10:35:34,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:35:35,190 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-17 10:35:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478811022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:35:35,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:35:35,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-03-17 10:35:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046716831] [2025-03-17 10:35:35,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:35:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 10:35:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:35,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 10:35:35,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-17 10:35:35,195 INFO L87 Difference]: Start difference. First operand 983 states and 1326 transitions. Second operand has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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-17 10:35:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:36,628 INFO L93 Difference]: Finished difference Result 6115 states and 8302 transitions. [2025-03-17 10:35:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 10:35:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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 382 [2025-03-17 10:35:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:36,649 INFO L225 Difference]: With dead ends: 6115 [2025-03-17 10:35:36,649 INFO L226 Difference]: Without dead ends: 5714 [2025-03-17 10:35:36,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 752 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-17 10:35:36,653 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 7472 mSDsluCounter, 15494 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7482 SdHoareTripleChecker+Valid, 17192 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:36,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7482 Valid, 17192 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 10:35:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-03-17 10:35:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 1829. [2025-03-17 10:35:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1813 states have (on average 1.346938775510204) internal successors, (2442), 1814 states have internal predecessors, (2442), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:35:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2466 transitions. [2025-03-17 10:35:36,728 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2466 transitions. Word has length 382 [2025-03-17 10:35:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:36,728 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2466 transitions. [2025-03-17 10:35:36,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.78260869565217) internal successors, (984), 23 states have internal predecessors, (984), 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-17 10:35:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2466 transitions. [2025-03-17 10:35:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-17 10:35:36,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:36,742 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] [2025-03-17 10:35:36,753 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-17 10:35:36,943 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,SelfDestructingSolverStorable8 [2025-03-17 10:35:36,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:36,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 270438979, now seen corresponding path program 2 times [2025-03-17 10:35:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352753427] [2025-03-17 10:35:36,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:35:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:37,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 826 statements into 2 equivalence classes. [2025-03-17 10:35:37,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 826 statements. [2025-03-17 10:35:37,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:35:37,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:37,317 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-17 10:35:37,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:37,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352753427] [2025-03-17 10:35:37,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352753427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:37,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:35:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192470408] [2025-03-17 10:35:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:37,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:35:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:37,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:35:37,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:37,320 INFO L87 Difference]: Start difference. First operand 1829 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:37,690 INFO L93 Difference]: Finished difference Result 2328 states and 3151 transitions. [2025-03-17 10:35:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:35:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 826 [2025-03-17 10:35:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:37,700 INFO L225 Difference]: With dead ends: 2328 [2025-03-17 10:35:37,701 INFO L226 Difference]: Without dead ends: 1930 [2025-03-17 10:35:37,702 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-17 10:35:37,702 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 80 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1627 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-17 10:35:37,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1627 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:35:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-17 10:35:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1835. [2025-03-17 10:35:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1819 states have (on average 1.3457943925233644) internal successors, (2448), 1820 states have internal predecessors, (2448), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:35:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2472 transitions. [2025-03-17 10:35:37,767 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2472 transitions. Word has length 826 [2025-03-17 10:35:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:37,768 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2472 transitions. [2025-03-17 10:35:37,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2472 transitions. [2025-03-17 10:35:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-17 10:35:37,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:37,787 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-17 10:35:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:35:37,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1226477423, now seen corresponding path program 1 times [2025-03-17 10:35:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382192442] [2025-03-17 10:35:37,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-17 10:35:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-17 10:35:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:40,166 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-17 10:35:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382192442] [2025-03-17 10:35:40,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382192442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:40,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:40,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:35:40,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055394375] [2025-03-17 10:35:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:40,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:35:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:40,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:35:40,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:40,168 INFO L87 Difference]: Start difference. First operand 1835 states and 2472 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-17 10:35:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:40,520 INFO L93 Difference]: Finished difference Result 2254 states and 3044 transitions. [2025-03-17 10:35:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:35:40,521 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-17 10:35:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:40,529 INFO L225 Difference]: With dead ends: 2254 [2025-03-17 10:35:40,529 INFO L226 Difference]: Without dead ends: 1850 [2025-03-17 10:35:40,530 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-17 10:35:40,531 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 14 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1512 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-17 10:35:40,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1512 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:35:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-17 10:35:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1847. [2025-03-17 10:35:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1831 states have (on average 1.345166575641726) internal successors, (2463), 1832 states have internal predecessors, (2463), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:35:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2487 transitions. [2025-03-17 10:35:40,596 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2487 transitions. Word has length 827 [2025-03-17 10:35:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:40,598 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2487 transitions. [2025-03-17 10:35:40,598 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-17 10:35:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2487 transitions. [2025-03-17 10:35:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 10:35:40,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:40,608 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-17 10:35:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:35:40,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 280153834, now seen corresponding path program 1 times [2025-03-17 10:35:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914834822] [2025-03-17 10:35:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:40,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-17 10:35:41,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-17 10:35:41,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:43,036 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-17 10:35:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914834822] [2025-03-17 10:35:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914834822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:43,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:43,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:35:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810627696] [2025-03-17 10:35:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:43,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:35:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:43,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:35:43,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:35:43,039 INFO L87 Difference]: Start difference. First operand 1847 states and 2487 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:35:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:43,495 INFO L93 Difference]: Finished difference Result 2296 states and 3101 transitions. [2025-03-17 10:35:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:35:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:35:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:43,503 INFO L225 Difference]: With dead ends: 2296 [2025-03-17 10:35:43,503 INFO L226 Difference]: Without dead ends: 1880 [2025-03-17 10:35:43,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:35:43,505 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 31 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:43,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2480 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:35:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-03-17 10:35:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1871. [2025-03-17 10:35:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1855 states have (on average 1.3423180592991915) internal successors, (2490), 1856 states have internal predecessors, (2490), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:35:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2514 transitions. [2025-03-17 10:35:43,550 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2514 transitions. Word has length 828 [2025-03-17 10:35:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:43,551 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2514 transitions. [2025-03-17 10:35:43,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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-17 10:35:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2514 transitions. [2025-03-17 10:35:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-17 10:35:43,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:43,557 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-17 10:35:43,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:35:43,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -956975753, now seen corresponding path program 1 times [2025-03-17 10:35:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555921060] [2025-03-17 10:35:43,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:43,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 10:35:44,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 10:35:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555921060] [2025-03-17 10:35:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555921060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354565145] [2025-03-17 10:35:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:51,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:35:51,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:35:51,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 10:35:52,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 10:35:52,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:52,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:52,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 4147 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 10:35:52,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:52,166 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-17 10:35:52,306 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-17 10:35:52,395 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-17 10:35:52,486 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-17 10:35:52,578 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-17 10:35:52,668 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-17 10:35:52,763 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-17 10:35:52,839 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-17 10:35:52,915 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-17 10:35:52,996 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-17 10:35:53,077 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-17 10:35:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:53,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:35:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354565145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:35:53,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:35:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2025-03-17 10:35:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977005348] [2025-03-17 10:35:53,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:35:53,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 10:35:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:53,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 10:35:53,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 10:35:53,970 INFO L87 Difference]: Start difference. First operand 1871 states and 2514 transitions. Second operand has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:35:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:57,085 INFO L93 Difference]: Finished difference Result 13563 states and 18212 transitions. [2025-03-17 10:35:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 10:35:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 829 [2025-03-17 10:35:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:57,124 INFO L225 Difference]: With dead ends: 13563 [2025-03-17 10:35:57,124 INFO L226 Difference]: Without dead ends: 13120 [2025-03-17 10:35:57,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1699 GetRequests, 1635 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=2778, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 10:35:57,129 INFO L435 NwaCegarLoop]: 3715 mSDtfsCounter, 17969 mSDsluCounter, 39694 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17991 SdHoareTripleChecker+Valid, 43409 SdHoareTripleChecker+Invalid, 4805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:57,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17991 Valid, 43409 Invalid, 4805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 10:35:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2025-03-17 10:35:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 3563. [2025-03-17 10:35:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3535 states have (on average 1.3425742574257427) internal successors, (4746), 3536 states have internal predecessors, (4746), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:35:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4794 transitions. [2025-03-17 10:35:57,297 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4794 transitions. Word has length 829 [2025-03-17 10:35:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:57,298 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4794 transitions. [2025-03-17 10:35:57,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 55.214285714285715) internal successors, (2319), 42 states have internal predecessors, (2319), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 10:35:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4794 transitions. [2025-03-17 10:35:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:35:57,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:57,315 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-17 10:35:57,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:35:57,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:57,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1118259737, now seen corresponding path program 2 times [2025-03-17 10:35:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787769664] [2025-03-17 10:35:57,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:35:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:57,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1717 statements into 2 equivalence classes. [2025-03-17 10:35:58,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1717 statements. [2025-03-17 10:35:58,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:35:58,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:35:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787769664] [2025-03-17 10:35:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787769664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:58,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 10:35:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031098787] [2025-03-17 10:35:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:58,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 10:35:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:58,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 10:35:58,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-17 10:35:58,642 INFO L87 Difference]: Start difference. First operand 3563 states and 4794 transitions. Second operand has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:00,306 INFO L93 Difference]: Finished difference Result 4111 states and 5555 transitions. [2025-03-17 10:36:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:36:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1717 [2025-03-17 10:36:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:00,316 INFO L225 Difference]: With dead ends: 4111 [2025-03-17 10:36:00,316 INFO L226 Difference]: Without dead ends: 3671 [2025-03-17 10:36:00,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-17 10:36:00,319 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 59 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:00,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4407 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 10:36:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2025-03-17 10:36:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3599. [2025-03-17 10:36:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3599 states, 3571 states have (on average 1.3433211985438254) internal successors, (4797), 3572 states have internal predecessors, (4797), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:36:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4845 transitions. [2025-03-17 10:36:00,405 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4845 transitions. Word has length 1717 [2025-03-17 10:36:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:00,407 INFO L471 AbstractCegarLoop]: Abstraction has 3599 states and 4845 transitions. [2025-03-17 10:36:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.294117647058824) internal successors, (158), 17 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4845 transitions. [2025-03-17 10:36:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1718 [2025-03-17 10:36:00,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:00,446 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-17 10:36:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:36:00,446 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:00,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash 969950972, now seen corresponding path program 1 times [2025-03-17 10:36:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:00,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263805810] [2025-03-17 10:36:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:00,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1717 statements into 1 equivalence classes. [2025-03-17 10:36:01,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1717 of 1717 statements. [2025-03-17 10:36:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17100 trivial. 0 not checked. [2025-03-17 10:36:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263805810] [2025-03-17 10:36:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263805810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:36:03,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:36:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620564704] [2025-03-17 10:36:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:36:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:03,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:36:03,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:36:03,978 INFO L87 Difference]: Start difference. First operand 3599 states and 4845 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:04,152 INFO L93 Difference]: Finished difference Result 4084 states and 5501 transitions. [2025-03-17 10:36:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:36:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1717 [2025-03-17 10:36:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:04,159 INFO L225 Difference]: With dead ends: 4084 [2025-03-17 10:36:04,160 INFO L226 Difference]: Without dead ends: 3608 [2025-03-17 10:36:04,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:36:04,163 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 8 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:04,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1259 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:36:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2025-03-17 10:36:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3608. [2025-03-17 10:36:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3580 states have (on average 1.3424581005586593) internal successors, (4806), 3581 states have internal predecessors, (4806), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:36:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 4854 transitions. [2025-03-17 10:36:04,234 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 4854 transitions. Word has length 1717 [2025-03-17 10:36:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 4854 transitions. [2025-03-17 10:36:04,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 4854 transitions. [2025-03-17 10:36:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1719 [2025-03-17 10:36:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:04,251 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-03-17 10:36:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:36:04,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2005873134, now seen corresponding path program 1 times [2025-03-17 10:36:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427371034] [2025-03-17 10:36:04,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:04,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-17 10:36:05,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-17 10:36:05,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:05,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427371034] [2025-03-17 10:36:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427371034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592541903] [2025-03-17 10:36:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:36,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:36,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:36:37,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1718 statements into 1 equivalence classes. [2025-03-17 10:36:38,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1718 of 1718 statements. [2025-03-17 10:36:38,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:38,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:38,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 8660 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 10:36:38,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:38,140 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-17 10:36:38,265 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-17 10:36:38,330 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-17 10:36:38,409 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-17 10:36:38,475 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-17 10:36:38,542 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-17 10:36:38,610 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-17 10:36:38,685 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-17 10:36:38,756 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-17 10:36:38,824 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-17 10:36:38,894 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-17 10:36:38,962 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-17 10:36:39,036 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-17 10:36:39,110 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-17 10:36:39,190 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-17 10:36:39,266 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-17 10:36:39,338 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-17 10:36:39,414 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-17 10:36:39,486 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-17 10:36:39,557 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-17 10:36:39,631 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-17 10:36:39,704 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-17 10:36:39,781 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-17 10:36:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17100 backedges. 0 proven. 17096 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:39,804 INFO L312 TraceCheckSpWp]: Computing backward predicates...