./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.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_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:35:44,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:35:44,947 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:44,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:35:44,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:35:44,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:35:44,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:35:44,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:35:44,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:35:44,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:35:44,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:35:44,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:35:44,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:35:44,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:35:44,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:35:44,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:35:44,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:35:44,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:35:44,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:44,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:35:44,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:35:44,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:35:44,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:35:44,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:35:44,982 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2025-03-17 10:35:45,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:35:45,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:35:45,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:35:45,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:35:45,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:35:45,246 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_test8-2.i [2025-03-17 10:35:46,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784f68493/2bb51596a98240feadcbce4193c26b6a/FLAG63eb422b9 [2025-03-17 10:35:46,748 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:35:46,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2025-03-17 10:35:46,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784f68493/2bb51596a98240feadcbce4193c26b6a/FLAG63eb422b9 [2025-03-17 10:35:47,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/784f68493/2bb51596a98240feadcbce4193c26b6a [2025-03-17 10:35:47,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:35:47,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:35:47,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:47,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:35:47,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:35:47,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:47" (1/1) ... [2025-03-17 10:35:47,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5001af7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:47, skipping insertion in model container [2025-03-17 10:35:47,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:35:47" (1/1) ... [2025-03-17 10:35:47,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:35:47,276 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_test8-2.i[33021,33034] [2025-03-17 10:35:47,357 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_test8-2.i[45234,45247] [2025-03-17 10:35:47,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:47,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:35:47,414 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_test8-2.i[33021,33034] [2025-03-17 10:35:47,477 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_test8-2.i[45234,45247] [2025-03-17 10:35:47,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:35:47,510 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:35:47,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:47 WrapperNode [2025-03-17 10:35:47,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:35:47,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:47,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:35:47,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:35:47,516 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:47" (1/1) ... [2025-03-17 10:35:47,531 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:47" (1/1) ... [2025-03-17 10:35:47,577 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-03-17 10:35:47,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:35:47,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:35:47,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:35:47,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:35:47,584 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:47" (1/1) ... [2025-03-17 10:35:47,585 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:47" (1/1) ... [2025-03-17 10:35:47,601 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:47" (1/1) ... [2025-03-17 10:35:47,679 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-03-17 10:35:47,680 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:47" (1/1) ... [2025-03-17 10:35:47,680 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:47" (1/1) ... [2025-03-17 10:35:47,708 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:47" (1/1) ... [2025-03-17 10:35:47,712 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:47" (1/1) ... [2025-03-17 10:35:47,716 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:47" (1/1) ... [2025-03-17 10:35:47,726 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:47" (1/1) ... [2025-03-17 10:35:47,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:35:47,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:35:47,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:35:47,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:35:47,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:47" (1/1) ... [2025-03-17 10:35:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:35:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:47,769 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:47,776 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:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:35:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:35:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:35:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:35:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:35:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:35:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:35:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:35:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-17 10:35:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:35:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:35:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:35:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:35:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:35:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:35:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:35:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:35:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:35:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:35:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:35:47,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:35:47,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:35:49,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:35:49,220 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-03-17 10:35:49,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:35:49,281 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:35:49,281 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:35:49,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:49 BoogieIcfgContainer [2025-03-17 10:35:49,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:35:49,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:35:49,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:35:49,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:35:49,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:35:47" (1/3) ... [2025-03-17 10:35:49,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb94e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:49, skipping insertion in model container [2025-03-17 10:35:49,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:35:47" (2/3) ... [2025-03-17 10:35:49,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb94e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:35:49, skipping insertion in model container [2025-03-17 10:35:49,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:35:49" (3/3) ... [2025-03-17 10:35:49,294 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2025-03-17 10:35:49,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:35:49,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test8-2.i that has 6 procedures, 470 locations, 1 initial locations, 40 loop locations, and 2 error locations. [2025-03-17 10:35:49,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:35:49,371 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;@5ea8193b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:35:49,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 10:35:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 436 states have (on average 1.628440366972477) internal successors, (710), 453 states have internal predecessors, (710), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:35:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:35:49,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:49,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:35:49,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 486124315, now seen corresponding path program 1 times [2025-03-17 10:35:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303712185] [2025-03-17 10:35:49,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:49,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:35:49,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:35:49,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:49,514 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:49,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:49,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303712185] [2025-03-17 10:35:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303712185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96690895] [2025-03-17 10:35:49,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:49,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:35:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:49,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:35:49,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:35:49,538 INFO L87 Difference]: Start difference. First operand has 462 states, 436 states have (on average 1.628440366972477) internal successors, (710), 453 states have internal predecessors, (710), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:49,675 INFO L93 Difference]: Finished difference Result 923 states and 1516 transitions. [2025-03-17 10:35:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:35:49,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-17 10:35:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:49,690 INFO L225 Difference]: With dead ends: 923 [2025-03-17 10:35:49,690 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 10:35:49,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:35:49,701 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:49,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 10:35:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-17 10:35:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.47) internal successors, (588), 416 states have internal predecessors, (588), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:35:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 628 transitions. [2025-03-17 10:35:49,755 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 628 transitions. Word has length 8 [2025-03-17 10:35:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:49,755 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 628 transitions. [2025-03-17 10:35:49,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 628 transitions. [2025-03-17 10:35:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 10:35:49,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:49,759 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] [2025-03-17 10:35:49,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:35:49,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 497064434, now seen corresponding path program 1 times [2025-03-17 10:35:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625978526] [2025-03-17 10:35:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:49,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 10:35:49,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 10:35:49,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:50,206 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:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625978526] [2025-03-17 10:35:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625978526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:50,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:35:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928066907] [2025-03-17 10:35:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:50,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:50,210 INFO L87 Difference]: Start difference. First operand 425 states and 628 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:50,482 INFO L93 Difference]: Finished difference Result 1030 states and 1522 transitions. [2025-03-17 10:35:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:35:50,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2025-03-17 10:35:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:50,487 INFO L225 Difference]: With dead ends: 1030 [2025-03-17 10:35:50,487 INFO L226 Difference]: Without dead ends: 804 [2025-03-17 10:35:50,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:35:50,490 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 541 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1693 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-17 10:35:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 427. [2025-03-17 10:35:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 402 states have (on average 1.4676616915422886) internal successors, (590), 418 states have internal predecessors, (590), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:35:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 630 transitions. [2025-03-17 10:35:50,520 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 630 transitions. Word has length 61 [2025-03-17 10:35:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:50,520 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 630 transitions. [2025-03-17 10:35:50,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 630 transitions. [2025-03-17 10:35:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 10:35:50,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:50,523 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] [2025-03-17 10:35:50,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:35:50,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 328527522, now seen corresponding path program 1 times [2025-03-17 10:35:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:50,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952975595] [2025-03-17 10:35:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 10:35:50,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 10:35:50,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:50,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:50,801 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:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952975595] [2025-03-17 10:35:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952975595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:35:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779307995] [2025-03-17 10:35:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:35:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:35:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:35:50,802 INFO L87 Difference]: Start difference. First operand 427 states and 630 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:50,964 INFO L93 Difference]: Finished difference Result 809 states and 1191 transitions. [2025-03-17 10:35:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:35:50,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-17 10:35:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:50,967 INFO L225 Difference]: With dead ends: 809 [2025-03-17 10:35:50,967 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 10:35:50,967 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:50,968 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 30 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:50,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1463 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 10:35:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 10:35:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 360 states have (on average 1.425) internal successors, (513), 376 states have internal predecessors, (513), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 10:35:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 553 transitions. [2025-03-17 10:35:50,985 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 553 transitions. Word has length 82 [2025-03-17 10:35:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:50,985 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 553 transitions. [2025-03-17 10:35:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 553 transitions. [2025-03-17 10:35:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 10:35:50,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:50,990 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] [2025-03-17 10:35:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:35:50,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:50,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2079526564, now seen corresponding path program 1 times [2025-03-17 10:35:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669750239] [2025-03-17 10:35:50,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:51,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 10:35:51,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 10:35:51,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:51,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:51,114 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:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669750239] [2025-03-17 10:35:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669750239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:35:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452090107] [2025-03-17 10:35:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:35:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:35:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:35:51,116 INFO L87 Difference]: Start difference. First operand 385 states and 553 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:51,268 INFO L93 Difference]: Finished difference Result 1015 states and 1461 transitions. [2025-03-17 10:35:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:35:51,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-17 10:35:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:51,271 INFO L225 Difference]: With dead ends: 1015 [2025-03-17 10:35:51,271 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 10:35:51,272 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:51,272 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 293 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:51,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1169 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:35:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 10:35:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2025-03-17 10:35:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4321192052980132) internal successors, (865), 620 states have internal predecessors, (865), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 907 transitions. [2025-03-17 10:35:51,295 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 907 transitions. Word has length 82 [2025-03-17 10:35:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 907 transitions. [2025-03-17 10:35:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:35:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 907 transitions. [2025-03-17 10:35:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 10:35:51,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:51,300 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] [2025-03-17 10:35:51,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:35:51,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -711697009, now seen corresponding path program 1 times [2025-03-17 10:35:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:51,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631184315] [2025-03-17 10:35:51,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:35:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:35:51,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:35:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631184315] [2025-03-17 10:35:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631184315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902710112] [2025-03-17 10:35:51,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:51,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:51,664 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:51,665 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:51,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:35:51,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:35:51,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:51,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 10:35:51,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:51,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:35:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 10:35:52,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:35:52,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-17 10:35:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:52,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:35:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902710112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:35:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-03-17 10:35:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541657360] [2025-03-17 10:35:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:35:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:52,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:35:52,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:35:52,561 INFO L87 Difference]: Start difference. First operand 630 states and 907 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:53,713 INFO L93 Difference]: Finished difference Result 1514 states and 2180 transitions. [2025-03-17 10:35:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:35:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-03-17 10:35:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:53,718 INFO L225 Difference]: With dead ends: 1514 [2025-03-17 10:35:53,718 INFO L226 Difference]: Without dead ends: 925 [2025-03-17 10:35:53,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 10:35:53,720 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 597 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:53,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2720 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 10:35:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-17 10:35:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 630. [2025-03-17 10:35:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4304635761589404) internal successors, (864), 620 states have internal predecessors, (864), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 906 transitions. [2025-03-17 10:35:53,747 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 906 transitions. Word has length 97 [2025-03-17 10:35:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:53,748 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 906 transitions. [2025-03-17 10:35:53,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 906 transitions. [2025-03-17 10:35:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 10:35:53,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:53,749 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] [2025-03-17 10:35:53,758 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:53,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:53,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:53,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 563911966, now seen corresponding path program 1 times [2025-03-17 10:35:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:53,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006963546] [2025-03-17 10:35:53,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:35:54,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:35:54,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:54,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:35:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006963546] [2025-03-17 10:35:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006963546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938026742] [2025-03-17 10:35:54,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:54,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:54,247 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:54,249 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:54,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:35:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:35:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:54,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 10:35:54,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:35:54,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 10:35:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:55,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:35:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938026742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:35:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-03-17 10:35:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755992125] [2025-03-17 10:35:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:35:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:55,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:35:55,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:35:55,095 INFO L87 Difference]: Start difference. First operand 630 states and 906 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:56,480 INFO L93 Difference]: Finished difference Result 1529 states and 2200 transitions. [2025-03-17 10:35:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 10:35:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-03-17 10:35:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:56,485 INFO L225 Difference]: With dead ends: 1529 [2025-03-17 10:35:56,485 INFO L226 Difference]: Without dead ends: 945 [2025-03-17 10:35:56,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-17 10:35:56,488 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 645 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 3518 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:56,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 3518 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 10:35:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-17 10:35:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 646. [2025-03-17 10:35:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 620 states have (on average 1.4258064516129032) internal successors, (884), 636 states have internal predecessors, (884), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 926 transitions. [2025-03-17 10:35:56,515 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 926 transitions. Word has length 98 [2025-03-17 10:35:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 926 transitions. [2025-03-17 10:35:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 926 transitions. [2025-03-17 10:35:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 10:35:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:56,516 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] [2025-03-17 10:35:56,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:35:56,717 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,SelfDestructingSolverStorable5 [2025-03-17 10:35:56,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1332451128, now seen corresponding path program 1 times [2025-03-17 10:35:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727392692] [2025-03-17 10:35:56,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:56,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 10:35:56,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 10:35:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727392692] [2025-03-17 10:35:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727392692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:35:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512315283] [2025-03-17 10:35:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:56,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:35:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:35:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:35:56,971 INFO L87 Difference]: Start difference. First operand 646 states and 926 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:57,288 INFO L93 Difference]: Finished difference Result 1247 states and 1800 transitions. [2025-03-17 10:35:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:35:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-17 10:35:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:57,291 INFO L225 Difference]: With dead ends: 1247 [2025-03-17 10:35:57,291 INFO L226 Difference]: Without dead ends: 656 [2025-03-17 10:35:57,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:35:57,292 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 14 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2678 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:35:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-17 10:35:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2025-03-17 10:35:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 628 states have (on average 1.4235668789808917) internal successors, (894), 644 states have internal predecessors, (894), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 936 transitions. [2025-03-17 10:35:57,307 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 936 transitions. Word has length 99 [2025-03-17 10:35:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:57,308 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 936 transitions. [2025-03-17 10:35:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 936 transitions. [2025-03-17 10:35:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 10:35:57,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:57,309 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] [2025-03-17 10:35:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:35:57,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 155770892, now seen corresponding path program 1 times [2025-03-17 10:35:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392079726] [2025-03-17 10:35:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:57,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 10:35:57,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 10:35:57,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:57,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392079726] [2025-03-17 10:35:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392079726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:35:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:35:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670260565] [2025-03-17 10:35:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:35:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:57,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:35:57,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:57,525 INFO L87 Difference]: Start difference. First operand 654 states and 936 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:57,790 INFO L93 Difference]: Finished difference Result 1262 states and 1820 transitions. [2025-03-17 10:35:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:35:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-17 10:35:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:57,793 INFO L225 Difference]: With dead ends: 1262 [2025-03-17 10:35:57,793 INFO L226 Difference]: Without dead ends: 660 [2025-03-17 10:35:57,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:35:57,794 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 9 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:57,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2252 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:35:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-17 10:35:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-03-17 10:35:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 634 states have (on average 1.4195583596214512) internal successors, (900), 650 states have internal predecessors, (900), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 942 transitions. [2025-03-17 10:35:57,810 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 942 transitions. Word has length 99 [2025-03-17 10:35:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 942 transitions. [2025-03-17 10:35:57,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 942 transitions. [2025-03-17 10:35:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 10:35:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:57,811 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] [2025-03-17 10:35:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:35:57,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2075742729, now seen corresponding path program 1 times [2025-03-17 10:35:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770068529] [2025-03-17 10:35:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:57,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:35:57,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:35:57,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:35:58,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770068529] [2025-03-17 10:35:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770068529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081861622] [2025-03-17 10:35:58,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:58,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:58,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:58,057 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:58,061 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:58,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:35:58,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:35:58,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:58,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:35:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:35:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:35:58,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:35:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081861622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:35:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:35:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 10:35:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307929558] [2025-03-17 10:35:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:35:58,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:35:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:35:58,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:35:58,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:35:58,376 INFO L87 Difference]: Start difference. First operand 660 states and 942 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:35:58,686 INFO L93 Difference]: Finished difference Result 1278 states and 1837 transitions. [2025-03-17 10:35:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:35:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-17 10:35:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:35:58,689 INFO L225 Difference]: With dead ends: 1278 [2025-03-17 10:35:58,689 INFO L226 Difference]: Without dead ends: 666 [2025-03-17 10:35:58,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:35:58,691 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 42 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:35:58,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2699 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:35:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-17 10:35:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 648. [2025-03-17 10:35:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 622 states have (on average 1.4180064308681672) internal successors, (882), 638 states have internal predecessors, (882), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:35:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 924 transitions. [2025-03-17 10:35:58,708 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 924 transitions. Word has length 100 [2025-03-17 10:35:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:35:58,708 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 924 transitions. [2025-03-17 10:35:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:35:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 924 transitions. [2025-03-17 10:35:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 10:35:58,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:35:58,711 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] [2025-03-17 10:35:58,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:35:58,915 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:58,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:35:58,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:35:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1823280143, now seen corresponding path program 1 times [2025-03-17 10:35:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:35:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54230094] [2025-03-17 10:35:58,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:35:58,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:35:59,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:35:59,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:59,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:35:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:35:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54230094] [2025-03-17 10:35:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54230094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:35:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970468616] [2025-03-17 10:35:59,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:35:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:35:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:35:59,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:35:59,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:35:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:35:59,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:35:59,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:35:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:35:59,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:35:59,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:14,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:36:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970468616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:36:14,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 10:36:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316688120] [2025-03-17 10:36:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:36:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:14,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:36:14,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:36:14,619 INFO L87 Difference]: Start difference. First operand 648 states and 924 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:18,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:23,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:27,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:28,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:32,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:34,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:36,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:36:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:36,841 INFO L93 Difference]: Finished difference Result 1246 states and 1792 transitions. [2025-03-17 10:36:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:36:36,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-17 10:36:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:36,845 INFO L225 Difference]: With dead ends: 1246 [2025-03-17 10:36:36,845 INFO L226 Difference]: Without dead ends: 658 [2025-03-17 10:36:36,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:36:36,846 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 12 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:36,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2684 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 571 Invalid, 4 Unknown, 0 Unchecked, 22.2s Time] [2025-03-17 10:36:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-17 10:36:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 648. [2025-03-17 10:36:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 622 states have (on average 1.4180064308681672) internal successors, (882), 638 states have internal predecessors, (882), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:36:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 924 transitions. [2025-03-17 10:36:36,863 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 924 transitions. Word has length 100 [2025-03-17 10:36:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:36,864 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 924 transitions. [2025-03-17 10:36:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 924 transitions. [2025-03-17 10:36:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 10:36:36,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:36,866 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] [2025-03-17 10:36:36,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 10:36:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:37,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:37,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1472042285, now seen corresponding path program 1 times [2025-03-17 10:36:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804830467] [2025-03-17 10:36:37,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:36:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:36:37,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:37,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804830467] [2025-03-17 10:36:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804830467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:36:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:36:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647640986] [2025-03-17 10:36:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:36:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:37,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:36:37,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:36:37,393 INFO L87 Difference]: Start difference. First operand 648 states and 924 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:37,948 INFO L93 Difference]: Finished difference Result 1268 states and 1821 transitions. [2025-03-17 10:36:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:36:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 10:36:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:37,951 INFO L225 Difference]: With dead ends: 1268 [2025-03-17 10:36:37,952 INFO L226 Difference]: Without dead ends: 680 [2025-03-17 10:36:37,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:36:37,953 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 23 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3636 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:37,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3636 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:36:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-17 10:36:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 668. [2025-03-17 10:36:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 642 states have (on average 1.411214953271028) internal successors, (906), 658 states have internal predecessors, (906), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 10:36:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 948 transitions. [2025-03-17 10:36:37,973 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 948 transitions. Word has length 102 [2025-03-17 10:36:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:37,974 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 948 transitions. [2025-03-17 10:36:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 948 transitions. [2025-03-17 10:36:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 10:36:37,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:37,974 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] [2025-03-17 10:36:37,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:36:37,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1057745842, now seen corresponding path program 1 times [2025-03-17 10:36:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017918439] [2025-03-17 10:36:37,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:38,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:36:38,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:36:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:36:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017918439] [2025-03-17 10:36:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017918439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304538711] [2025-03-17 10:36:38,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:38,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:38,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:38,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:38,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 10:36:38,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 10:36:38,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 10:36:38,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:38,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:38,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 10:36:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:36:38,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:36:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304538711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:38,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:36:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 10:36:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004992751] [2025-03-17 10:36:38,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:38,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:36:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:38,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:36:38,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:36:38,529 INFO L87 Difference]: Start difference. First operand 668 states and 948 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:36:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:38,627 INFO L93 Difference]: Finished difference Result 1232 states and 1763 transitions. [2025-03-17 10:36:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:36:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-03-17 10:36:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:38,630 INFO L225 Difference]: With dead ends: 1232 [2025-03-17 10:36:38,632 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 10:36:38,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:36:38,633 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:38,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1520 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:36:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 10:36:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-03-17 10:36:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 644 states have (on average 1.4114906832298137) internal successors, (909), 661 states have internal predecessors, (909), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 952 transitions. [2025-03-17 10:36:38,650 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 952 transitions. Word has length 102 [2025-03-17 10:36:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:38,650 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 952 transitions. [2025-03-17 10:36:38,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:36:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 952 transitions. [2025-03-17 10:36:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 10:36:38,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:38,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:36:38,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 10:36:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 10:36:38,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:38,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash -658201070, now seen corresponding path program 1 times [2025-03-17 10:36:38,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:38,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276710905] [2025-03-17 10:36:38,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:38,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:36:38,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:36:38,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:38,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:36:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276710905] [2025-03-17 10:36:39,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276710905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066356966] [2025-03-17 10:36:39,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:39,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:39,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:39,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:39,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 10:36:39,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 10:36:39,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 10:36:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:39,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 10:36:39,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:36:39,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:36:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 10:36:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066356966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:36:39,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:36:39,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 10:36:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23990404] [2025-03-17 10:36:39,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:36:39,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:36:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:39,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:36:39,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:36:39,450 INFO L87 Difference]: Start difference. First operand 671 states and 952 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:39,659 INFO L93 Difference]: Finished difference Result 1246 states and 1784 transitions. [2025-03-17 10:36:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:36:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2025-03-17 10:36:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:39,662 INFO L225 Difference]: With dead ends: 1246 [2025-03-17 10:36:39,662 INFO L226 Difference]: Without dead ends: 680 [2025-03-17 10:36:39,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:36:39,663 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 4 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:39,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2529 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:36:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-17 10:36:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2025-03-17 10:36:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 652 states have (on average 1.4125766871165644) internal successors, (921), 669 states have internal predecessors, (921), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 964 transitions. [2025-03-17 10:36:39,677 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 964 transitions. Word has length 104 [2025-03-17 10:36:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:39,678 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 964 transitions. [2025-03-17 10:36:39,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 964 transitions. [2025-03-17 10:36:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 10:36:39,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:39,679 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-03-17 10:36:39,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 10:36:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:39,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -138985330, now seen corresponding path program 2 times [2025-03-17 10:36:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322549159] [2025-03-17 10:36:39,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:36:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:39,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-17 10:36:39,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 108 statements. [2025-03-17 10:36:39,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:36:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-17 10:36:40,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322549159] [2025-03-17 10:36:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322549159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:36:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:36:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400180001] [2025-03-17 10:36:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:36:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:40,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:36:40,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:36:40,124 INFO L87 Difference]: Start difference. First operand 680 states and 964 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:40,529 INFO L93 Difference]: Finished difference Result 1298 states and 1857 transitions. [2025-03-17 10:36:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:36:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-17 10:36:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:40,532 INFO L225 Difference]: With dead ends: 1298 [2025-03-17 10:36:40,532 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 10:36:40,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:36:40,533 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 8 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:40,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2668 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:36:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 10:36:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-17 10:36:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 658 states have (on average 1.4088145896656534) internal successors, (927), 675 states have internal predecessors, (927), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 970 transitions. [2025-03-17 10:36:40,547 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 970 transitions. Word has length 108 [2025-03-17 10:36:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:40,548 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 970 transitions. [2025-03-17 10:36:40,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 970 transitions. [2025-03-17 10:36:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 10:36:40,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:40,549 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-03-17 10:36:40,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:36:40,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:40,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1497495382, now seen corresponding path program 1 times [2025-03-17 10:36:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671198619] [2025-03-17 10:36:40,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 10:36:40,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 10:36:40,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:40,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671198619] [2025-03-17 10:36:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671198619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136086079] [2025-03-17 10:36:40,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:40,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:40,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 10:36:41,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 10:36:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 10:36:41,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:36:41,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:36:41,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:36:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:36:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136086079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:36:41,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:36:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-03-17 10:36:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952580459] [2025-03-17 10:36:41,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:36:41,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 10:36:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:41,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 10:36:41,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-03-17 10:36:41,530 INFO L87 Difference]: Start difference. First operand 686 states and 970 transitions. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:42,042 INFO L93 Difference]: Finished difference Result 1277 states and 1823 transitions. [2025-03-17 10:36:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 10:36:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 108 [2025-03-17 10:36:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:42,047 INFO L225 Difference]: With dead ends: 1277 [2025-03-17 10:36:42,047 INFO L226 Difference]: Without dead ends: 697 [2025-03-17 10:36:42,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=489, Unknown=0, NotChecked=0, Total=756 [2025-03-17 10:36:42,049 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 30 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3948 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:42,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3948 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:36:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-17 10:36:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-03-17 10:36:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 667 states have (on average 1.4077961019490255) internal successors, (939), 684 states have internal predecessors, (939), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 982 transitions. [2025-03-17 10:36:42,066 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 982 transitions. Word has length 108 [2025-03-17 10:36:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:42,066 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 982 transitions. [2025-03-17 10:36:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 982 transitions. [2025-03-17 10:36:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 10:36:42,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:42,068 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-03-17 10:36:42,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 10:36:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:42,269 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash -582974144, now seen corresponding path program 2 times [2025-03-17 10:36:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503556626] [2025-03-17 10:36:42,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:36:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:42,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-17 10:36:42,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 117 statements. [2025-03-17 10:36:42,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:36:42,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-17 10:36:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503556626] [2025-03-17 10:36:42,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503556626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:42,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:36:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:36:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984262806] [2025-03-17 10:36:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:42,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:36:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:42,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:36:42,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:36:42,530 INFO L87 Difference]: Start difference. First operand 695 states and 982 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:43,083 INFO L93 Difference]: Finished difference Result 1341 states and 1909 transitions. [2025-03-17 10:36:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:36:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2025-03-17 10:36:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:43,086 INFO L225 Difference]: With dead ends: 1341 [2025-03-17 10:36:43,086 INFO L226 Difference]: Without dead ends: 729 [2025-03-17 10:36:43,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:36:43,087 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 17 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:43,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4027 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:36:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-17 10:36:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 705. [2025-03-17 10:36:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 677 states have (on average 1.4047267355982276) internal successors, (951), 694 states have internal predecessors, (951), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 994 transitions. [2025-03-17 10:36:43,108 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 994 transitions. Word has length 117 [2025-03-17 10:36:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:43,109 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 994 transitions. [2025-03-17 10:36:43,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 994 transitions. [2025-03-17 10:36:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 10:36:43,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:43,111 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-03-17 10:36:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:36:43,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 337599170, now seen corresponding path program 1 times [2025-03-17 10:36:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430824003] [2025-03-17 10:36:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 10:36:43,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 10:36:43,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:43,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 10:36:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430824003] [2025-03-17 10:36:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430824003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73471106] [2025-03-17 10:36:43,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:43,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:43,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 10:36:44,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 10:36:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 10:36:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:44,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 10:36:44,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:36:44,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:36:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 10:36:44,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73471106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:36:44,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:36:44,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2025-03-17 10:36:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215328488] [2025-03-17 10:36:44,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:36:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 10:36:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:44,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 10:36:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=888, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 10:36:44,953 INFO L87 Difference]: Start difference. First operand 705 states and 994 transitions. Second operand has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:48,236 INFO L93 Difference]: Finished difference Result 1319 states and 1883 transitions. [2025-03-17 10:36:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 10:36:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2025-03-17 10:36:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:48,239 INFO L225 Difference]: With dead ends: 1319 [2025-03-17 10:36:48,239 INFO L226 Difference]: Without dead ends: 725 [2025-03-17 10:36:48,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1117, Invalid=2075, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 10:36:48,243 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 18 mSDsluCounter, 6071 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6579 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:48,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6579 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:36:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-17 10:36:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 723. [2025-03-17 10:36:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 695 states have (on average 1.4028776978417266) internal successors, (975), 712 states have internal predecessors, (975), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1018 transitions. [2025-03-17 10:36:48,258 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1018 transitions. Word has length 118 [2025-03-17 10:36:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1018 transitions. [2025-03-17 10:36:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:36:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1018 transitions. [2025-03-17 10:36:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 10:36:48,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:48,260 INFO L218 NwaCegarLoop]: trace histogram [33, 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] [2025-03-17 10:36:48,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 10:36:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 10:36:48,460 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:48,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1488945022, now seen corresponding path program 2 times [2025-03-17 10:36:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197586653] [2025-03-17 10:36:48,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:36:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:48,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-17 10:36:48,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 136 statements. [2025-03-17 10:36:48,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:36:48,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-17 10:36:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197586653] [2025-03-17 10:36:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197586653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:36:48,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:36:48,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:36:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339437990] [2025-03-17 10:36:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:36:48,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:36:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:36:48,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:36:48,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:36:48,863 INFO L87 Difference]: Start difference. First operand 723 states and 1018 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:36:49,542 INFO L93 Difference]: Finished difference Result 1382 states and 1963 transitions. [2025-03-17 10:36:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:36:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2025-03-17 10:36:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:36:49,547 INFO L225 Difference]: With dead ends: 1382 [2025-03-17 10:36:49,547 INFO L226 Difference]: Without dead ends: 747 [2025-03-17 10:36:49,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:36:49,549 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 13 mSDsluCounter, 3518 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:36:49,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4016 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:36:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-17 10:36:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 731. [2025-03-17 10:36:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 703 states have (on average 1.4011379800853485) internal successors, (985), 720 states have internal predecessors, (985), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-17 10:36:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1028 transitions. [2025-03-17 10:36:49,564 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1028 transitions. Word has length 136 [2025-03-17 10:36:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:36:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1028 transitions. [2025-03-17 10:36:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:36:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1028 transitions. [2025-03-17 10:36:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 10:36:49,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:36:49,565 INFO L218 NwaCegarLoop]: trace histogram [33, 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] [2025-03-17 10:36:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:36:49,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:36:49,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:36:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1033670806, now seen corresponding path program 1 times [2025-03-17 10:36:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:36:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987666755] [2025-03-17 10:36:49,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:36:49,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 10:36:49,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 10:36:49,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:49,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 10:36:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:36:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987666755] [2025-03-17 10:36:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987666755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:36:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919603478] [2025-03-17 10:36:50,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:36:50,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:36:50,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:36:50,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:36:50,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 10:36:51,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 10:36:51,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 10:36:51,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:36:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:36:51,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 297 conjuncts are in the unsatisfiable core [2025-03-17 10:36:51,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:36:51,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 10:36:51,744 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-17 10:36:51,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-17 10:36:51,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 10:36:51,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:36:51,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 10:36:51,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 10:36:52,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 10:36:52,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 10:36:52,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:52,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 10:36:52,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:52,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 10:36:53,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:53,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2025-03-17 10:36:53,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:53,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 70 [2025-03-17 10:36:53,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:53,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 82 [2025-03-17 10:36:53,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:53,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 77 treesize of output 94 [2025-03-17 10:36:53,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 10:36:53,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 86 treesize of output 106 [2025-03-17 10:36:53,772 INFO L349 Elim1Store]: treesize reduction 162, result has 33.6 percent of original size [2025-03-17 10:36:53,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 95 treesize of output 118 [2025-03-17 10:36:54,044 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 10:36:54,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 135 [2025-03-17 10:36:54,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11