./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.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_test5-3.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 cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:35:07,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:35:07,085 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:07,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:35:07,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:35:07,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:35:07,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:35:07,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:35:07,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:35:07,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:35:07,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:35:07,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:35:07,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:35:07,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:35:07,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:35:07,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:35:07,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:35:07,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:07,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:35:07,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:35:07,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:35:07,109 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2025-03-17 10:35:07,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:35:07,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:35:07,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:35:07,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:35:07,372 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:35:07,373 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_test5-3.i [2025-03-17 10:35:08,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e1d1f2/27e1f8d32640480fbb074c9a63a1d2bb/FLAGe1163cfcd [2025-03-17 10:35:08,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:35:08,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2025-03-17 10:35:08,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e1d1f2/27e1f8d32640480fbb074c9a63a1d2bb/FLAGe1163cfcd [2025-03-17 10:35:08,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e1d1f2/27e1f8d32640480fbb074c9a63a1d2bb [2025-03-17 10:35:08,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:35:08,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:35:08,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:08,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:35:08,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:35:08,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:08" (1/1) ... [2025-03-17 10:35:08,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:08, skipping insertion in model container [2025-03-17 10:35:08,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:08" (1/1) ... [2025-03-17 10:35:08,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:35:09,168 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_test5-3.i[33021,33034] [2025-03-17 10:35:09,264 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_test5-3.i[49681,49694] [2025-03-17 10:35:09,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:09,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:35:09,329 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_test5-3.i[33021,33034] [2025-03-17 10:35:09,393 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_test5-3.i[49681,49694] [2025-03-17 10:35:09,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:09,423 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:35:09,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:09 WrapperNode [2025-03-17 10:35:09,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:09,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:09,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:35:09,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:35:09,428 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:09" (1/1) ... [2025-03-17 10:35:09,448 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:09" (1/1) ... [2025-03-17 10:35:09,509 INFO L138 Inliner]: procedures = 177, calls = 472, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2278 [2025-03-17 10:35:09,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:09,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:35:09,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:35:09,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:35:09,517 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:09" (1/1) ... [2025-03-17 10:35:09,518 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:09" (1/1) ... [2025-03-17 10:35:09,531 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:09" (1/1) ... [2025-03-17 10:35:09,665 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2025-03-17 10:35:09,665 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:09" (1/1) ... [2025-03-17 10:35:09,666 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:09" (1/1) ... [2025-03-17 10:35:09,713 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:09" (1/1) ... [2025-03-17 10:35:09,719 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:09" (1/1) ... [2025-03-17 10:35:09,725 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:09" (1/1) ... [2025-03-17 10:35:09,731 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:09" (1/1) ... [2025-03-17 10:35:09,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:35:09,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:35:09,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:35:09,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:35:09,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:09" (1/1) ... [2025-03-17 10:35:09,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:09,767 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:09,769 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:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:35:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:35:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:35:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:35:09,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:35:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:35:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:35:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:35:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:09,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:09,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:09,789 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:35:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:35:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:35:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:35:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:35:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:35:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:35:09,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:35:10,002 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:35:10,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:35:11,634 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 10:35:11,761 INFO L? ?]: Removed 524 outVars from TransFormulas that were not future-live. [2025-03-17 10:35:11,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:35:11,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:35:11,828 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:35:11,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:11 BoogieIcfgContainer [2025-03-17 10:35:11,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:35:11,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:35:11,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:35:11,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:35:11,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:35:08" (1/3) ... [2025-03-17 10:35:11,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1945ee89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:11, skipping insertion in model container [2025-03-17 10:35:11,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:09" (2/3) ... [2025-03-17 10:35:11,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1945ee89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:11, skipping insertion in model container [2025-03-17 10:35:11,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:11" (3/3) ... [2025-03-17 10:35:11,836 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-3.i [2025-03-17 10:35:11,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:35:11,849 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-3.i that has 5 procedures, 625 locations, 1 initial locations, 55 loop locations, and 2 error locations. [2025-03-17 10:35:11,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:35:11,913 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;@468f75d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:35:11,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:35:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 617 states, 601 states have (on average 1.6256239600665559) internal successors, (977), 608 states have internal predecessors, (977), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 10:35:11,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:11,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 10:35:11,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:11,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1910133135, now seen corresponding path program 1 times [2025-03-17 10:35:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:11,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023155428] [2025-03-17 10:35:11,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:12,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 10:35:12,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 10:35:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:12,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:12,099 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:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023155428] [2025-03-17 10:35:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023155428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:12,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477557604] [2025-03-17 10:35:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:12,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:12,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:12,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:12,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:12,122 INFO L87 Difference]: Start difference. First operand has 617 states, 601 states have (on average 1.6256239600665559) internal successors, (977), 608 states have internal predecessors, (977), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:12,437 INFO L93 Difference]: Finished difference Result 1776 states and 2894 transitions. [2025-03-17 10:35:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 10:35:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:12,451 INFO L225 Difference]: With dead ends: 1776 [2025-03-17 10:35:12,451 INFO L226 Difference]: Without dead ends: 1097 [2025-03-17 10:35:12,456 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:12,458 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 778 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:12,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1665 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-03-17 10:35:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 555. [2025-03-17 10:35:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 540 states have (on average 1.4666666666666666) internal successors, (792), 546 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 814 transitions. [2025-03-17 10:35:12,532 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 814 transitions. Word has length 6 [2025-03-17 10:35:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:12,533 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 814 transitions. [2025-03-17 10:35:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 814 transitions. [2025-03-17 10:35:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:35:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:12,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:35:12,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1850799099, now seen corresponding path program 1 times [2025-03-17 10:35:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901450774] [2025-03-17 10:35:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:12,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:35:12,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:35:12,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:12,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:35:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901450774] [2025-03-17 10:35:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901450774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:13,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259940478] [2025-03-17 10:35:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:13,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:13,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:13,251 INFO L87 Difference]: Start difference. First operand 555 states and 814 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:13,455 INFO L93 Difference]: Finished difference Result 1111 states and 1629 transitions. [2025-03-17 10:35:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:35:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-17 10:35:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:13,458 INFO L225 Difference]: With dead ends: 1111 [2025-03-17 10:35:13,458 INFO L226 Difference]: Without dead ends: 558 [2025-03-17 10:35:13,459 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:13,460 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 105 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:13,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2085 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-17 10:35:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 555. [2025-03-17 10:35:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 540 states have (on average 1.4537037037037037) internal successors, (785), 546 states have internal predecessors, (785), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 807 transitions. [2025-03-17 10:35:13,484 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 807 transitions. Word has length 200 [2025-03-17 10:35:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:13,484 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 807 transitions. [2025-03-17 10:35:13,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 807 transitions. [2025-03-17 10:35:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:35:13,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:13,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:13,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:35:13,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash -262996670, now seen corresponding path program 1 times [2025-03-17 10:35:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948140283] [2025-03-17 10:35:13,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:13,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:35:13,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:35:13,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:13,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:35:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:13,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948140283] [2025-03-17 10:35:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948140283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:13,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:13,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:35:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390007084] [2025-03-17 10:35:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:13,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:13,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:13,797 INFO L87 Difference]: Start difference. First operand 555 states and 807 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:13,930 INFO L93 Difference]: Finished difference Result 1114 states and 1621 transitions. [2025-03-17 10:35:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-17 10:35:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:13,933 INFO L225 Difference]: With dead ends: 1114 [2025-03-17 10:35:13,934 INFO L226 Difference]: Without dead ends: 561 [2025-03-17 10:35:13,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:13,937 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:13,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1452 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-17 10:35:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-17 10:35:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4487179487179487) internal successors, (791), 552 states have internal predecessors, (791), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 813 transitions. [2025-03-17 10:35:13,948 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 813 transitions. Word has length 200 [2025-03-17 10:35:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:13,949 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 813 transitions. [2025-03-17 10:35:13,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 813 transitions. [2025-03-17 10:35:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 10:35:13,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:13,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:13,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:35:13,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash -526693695, now seen corresponding path program 1 times [2025-03-17 10:35:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275419090] [2025-03-17 10:35:13,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:14,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 10:35:14,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 10:35:14,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:14,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:35:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275419090] [2025-03-17 10:35:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275419090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006330836] [2025-03-17 10:35:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:14,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:14,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:14,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:14,239 INFO L87 Difference]: Start difference. First operand 561 states and 813 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:14,405 INFO L93 Difference]: Finished difference Result 1253 states and 1817 transitions. [2025-03-17 10:35:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-17 10:35:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:14,409 INFO L225 Difference]: With dead ends: 1253 [2025-03-17 10:35:14,410 INFO L226 Difference]: Without dead ends: 694 [2025-03-17 10:35:14,412 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:14,414 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 134 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:14,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1477 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-17 10:35:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-17 10:35:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 679 states have (on average 1.4477172312223858) internal successors, (983), 685 states have internal predecessors, (983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1005 transitions. [2025-03-17 10:35:14,438 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1005 transitions. Word has length 200 [2025-03-17 10:35:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:14,438 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1005 transitions. [2025-03-17 10:35:14,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1005 transitions. [2025-03-17 10:35:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 10:35:14,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:14,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:35:14,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -735447275, now seen corresponding path program 1 times [2025-03-17 10:35:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509546179] [2025-03-17 10:35:14,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 10:35:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 10:35:14,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:14,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509546179] [2025-03-17 10:35:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509546179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084675174] [2025-03-17 10:35:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:14,825 INFO L87 Difference]: Start difference. First operand 694 states and 1005 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:14,994 INFO L93 Difference]: Finished difference Result 1211 states and 1750 transitions. [2025-03-17 10:35:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:35:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 215 [2025-03-17 10:35:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:14,997 INFO L225 Difference]: With dead ends: 1211 [2025-03-17 10:35:14,997 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 10:35:14,998 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:14,998 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 30 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:14,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1934 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 10:35:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-03-17 10:35:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 637 states have (on average 1.4222919937205651) internal successors, (906), 643 states have internal predecessors, (906), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:35:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 928 transitions. [2025-03-17 10:35:15,012 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 928 transitions. Word has length 215 [2025-03-17 10:35:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:15,012 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 928 transitions. [2025-03-17 10:35:15,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 928 transitions. [2025-03-17 10:35:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 10:35:15,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:15,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:15,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:35:15,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:15,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash -763150641, now seen corresponding path program 1 times [2025-03-17 10:35:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049451332] [2025-03-17 10:35:15,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 10:35:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 10:35:15,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:15,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:15,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049451332] [2025-03-17 10:35:15,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049451332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:15,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:35:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033973063] [2025-03-17 10:35:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:15,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:15,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:15,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:15,267 INFO L87 Difference]: Start difference. First operand 652 states and 928 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:15,446 INFO L93 Difference]: Finished difference Result 1456 states and 2078 transitions. [2025-03-17 10:35:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:15,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 215 [2025-03-17 10:35:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:15,451 INFO L225 Difference]: With dead ends: 1456 [2025-03-17 10:35:15,451 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 10:35:15,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:15,453 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 451 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1498 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 10:35:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2025-03-17 10:35:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 914 states have (on average 1.425601750547046) internal successors, (1303), 925 states have internal predecessors, (1303), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:35:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1341 transitions. [2025-03-17 10:35:15,476 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1341 transitions. Word has length 215 [2025-03-17 10:35:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:15,476 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1341 transitions. [2025-03-17 10:35:15,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1341 transitions. [2025-03-17 10:35:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 10:35:15,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:15,478 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:15,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:35:15,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1547460146, now seen corresponding path program 1 times [2025-03-17 10:35:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545165004] [2025-03-17 10:35:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:15,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:35:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:35:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:15,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545165004] [2025-03-17 10:35:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545165004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457160887] [2025-03-17 10:35:15,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:15,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:15,839 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:15,841 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:16,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:35:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:35:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:16,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:35:16,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 10:35:16,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:35:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457160887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:35:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 10:35:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279341527] [2025-03-17 10:35:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:16,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:16,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:16,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:16,343 INFO L87 Difference]: Start difference. First operand 937 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:35:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:16,491 INFO L93 Difference]: Finished difference Result 1256 states and 1821 transitions. [2025-03-17 10:35:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:35:16,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 230 [2025-03-17 10:35:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:16,496 INFO L225 Difference]: With dead ends: 1256 [2025-03-17 10:35:16,496 INFO L226 Difference]: Without dead ends: 943 [2025-03-17 10:35:16,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:35:16,497 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 105 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1842 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-17 10:35:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2025-03-17 10:35:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 914 states have (on average 1.4102844638949672) internal successors, (1289), 925 states have internal predecessors, (1289), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 10:35:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1327 transitions. [2025-03-17 10:35:16,520 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1327 transitions. Word has length 230 [2025-03-17 10:35:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:16,520 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1327 transitions. [2025-03-17 10:35:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:35:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1327 transitions. [2025-03-17 10:35:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 10:35:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:16,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:16,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:35:16,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:16,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:16,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -671637209, now seen corresponding path program 1 times [2025-03-17 10:35:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563952683] [2025-03-17 10:35:16,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:16,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:35:16,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:35:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563952683] [2025-03-17 10:35:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563952683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410514960] [2025-03-17 10:35:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:17,011 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:17,013 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:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 10:35:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 10:35:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:17,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:35:17,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:17,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:35:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410514960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:35:17,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:35:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:35:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068921248] [2025-03-17 10:35:17,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:35:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:35:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:17,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:35:17,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:35:17,844 INFO L87 Difference]: Start difference. First operand 937 states and 1327 transitions. Second operand has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:35:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:18,192 INFO L93 Difference]: Finished difference Result 2484 states and 3545 transitions. [2025-03-17 10:35:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:35:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 230 [2025-03-17 10:35:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:18,200 INFO L225 Difference]: With dead ends: 2484 [2025-03-17 10:35:18,200 INFO L226 Difference]: Without dead ends: 2171 [2025-03-17 10:35:18,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:35:18,202 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 3365 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:18,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 2847 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:35:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-17 10:35:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1683. [2025-03-17 10:35:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1645 states have (on average 1.3914893617021276) internal successors, (2289), 1656 states have internal predecessors, (2289), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 10:35:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2357 transitions. [2025-03-17 10:35:18,245 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2357 transitions. Word has length 230 [2025-03-17 10:35:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:18,245 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2357 transitions. [2025-03-17 10:35:18,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:35:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2357 transitions. [2025-03-17 10:35:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-17 10:35:18,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:18,254 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:18,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:35:18,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 10:35:18,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -178819588, now seen corresponding path program 1 times [2025-03-17 10:35:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883466785] [2025-03-17 10:35:18,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:18,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-17 10:35:18,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-17 10:35:18,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:18,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 4 proven. 357 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-17 10:35:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883466785] [2025-03-17 10:35:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883466785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402804156] [2025-03-17 10:35:19,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:19,251 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:19,253 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:19,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-17 10:35:20,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-17 10:35:20,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:20,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:20,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 3246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:35:20,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:20,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:35:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:35:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402804156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:35:21,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:35:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-17 10:35:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895562763] [2025-03-17 10:35:21,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:35:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:35:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:35:21,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:35:21,463 INFO L87 Difference]: Start difference. First operand 1683 states and 2357 transitions. Second operand has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:35:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:25,709 INFO L93 Difference]: Finished difference Result 5400 states and 7606 transitions. [2025-03-17 10:35:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 10:35:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 656 [2025-03-17 10:35:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:25,728 INFO L225 Difference]: With dead ends: 5400 [2025-03-17 10:35:25,728 INFO L226 Difference]: Without dead ends: 4337 [2025-03-17 10:35:25,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1302 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:35:25,732 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 16731 mSDsluCounter, 5549 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16731 SdHoareTripleChecker+Valid, 6520 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:25,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16731 Valid, 6520 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-17 10:35:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2025-03-17 10:35:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 3512. [2025-03-17 10:35:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 3461 states have (on average 1.3828373302513723) internal successors, (4786), 3467 states have internal predecessors, (4786), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 10:35:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 4880 transitions. [2025-03-17 10:35:25,809 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 4880 transitions. Word has length 656 [2025-03-17 10:35:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:25,810 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 4880 transitions. [2025-03-17 10:35:25,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.57142857142857) internal successors, (1548), 14 states have internal predecessors, (1548), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 10:35:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4880 transitions. [2025-03-17 10:35:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1519 [2025-03-17 10:35:25,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:25,859 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:25,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 10:35:26,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:26,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1162962616, now seen corresponding path program 1 times [2025-03-17 10:35:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371603605] [2025-03-17 10:35:26,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1518 statements into 1 equivalence classes.