./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:35:14,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:35:14,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:35:14,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:35:14,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:35:14,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:35:14,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:35:14,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:35:14,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:35:14,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:35:14,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:35:14,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:35:14,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:35:14,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:35:14,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:14,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:35:14,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:35:14,788 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2025-03-08 06:35:15,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:35:15,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:35:15,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:35:15,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:35:15,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:35:15,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-03-08 06:35:16,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa8a12f4/036c055f7eb146a5b0524750c7b350d4/FLAG3a4576862 [2025-03-08 06:35:16,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:35:16,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-03-08 06:35:16,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa8a12f4/036c055f7eb146a5b0524750c7b350d4/FLAG3a4576862 [2025-03-08 06:35:16,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa8a12f4/036c055f7eb146a5b0524750c7b350d4 [2025-03-08 06:35:16,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:35:16,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:35:16,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:16,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:35:16,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:35:16,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:16,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bb3cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16, skipping insertion in model container [2025-03-08 06:35:16,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:16,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:35:16,759 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/seq-pthread/cs_stateful-2.i[23607,23620] [2025-03-08 06:35:16,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:16,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:35:16,885 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/seq-pthread/cs_stateful-2.i[23607,23620] [2025-03-08 06:35:16,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:16,949 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:35:16,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16 WrapperNode [2025-03-08 06:35:16,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:16,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:16,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:35:16,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:35:16,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:16,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,000 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 548 [2025-03-08 06:35:17,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:17,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:35:17,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:35:17,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:35:17,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,038 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 3, 8, 8, 8, 20, 12, 3, 6, 3, 7, 10, 10, 3, 7, 0, 12]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 3, 6, 6, 0, 2, 0, 0, 2, 2, 0, 0, 0, 4]. The 37 writes are split as follows [0, 1, 2, 2, 2, 8, 3, 1, 2, 1, 1, 4, 4, 1, 1, 0, 4]. [2025-03-08 06:35:17,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:35:17,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:35:17,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:35:17,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:35:17,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (1/1) ... [2025-03-08 06:35:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:17,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:17,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:35:17,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:35:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:35:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-03-08 06:35:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:35:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:35:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:35:17,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:17,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:35:17,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:35:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:35:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:35:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:35:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:35:17,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:35:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:35:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:35:17,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:35:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:35:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:35:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:17,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:35:17,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:35:17,348 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:35:17,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:35:17,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:17,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:17,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:17,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:18,044 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-08 06:35:18,044 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:35:18,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:35:18,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:35:18,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:18 BoogieIcfgContainer [2025-03-08 06:35:18,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:35:18,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:35:18,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:35:18,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:35:18,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:35:16" (1/3) ... [2025-03-08 06:35:18,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb73d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:18, skipping insertion in model container [2025-03-08 06:35:18,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:16" (2/3) ... [2025-03-08 06:35:18,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb73d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:18, skipping insertion in model container [2025-03-08 06:35:18,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:18" (3/3) ... [2025-03-08 06:35:18,068 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2025-03-08 06:35:18,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:35:18,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-2.i that has 9 procedures, 169 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 06:35:18,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:35:18,140 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;@690c8376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:35:18,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:35:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 06:35:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:35:18,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:18,157 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:18,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:18,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 680485318, now seen corresponding path program 1 times [2025-03-08 06:35:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691016228] [2025-03-08 06:35:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:18,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:18,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:35:18,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:35:18,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:18,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691016228] [2025-03-08 06:35:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691016228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243464191] [2025-03-08 06:35:18,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:18,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:18,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:18,668 INFO L87 Difference]: Start difference. First operand has 169 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:18,789 INFO L93 Difference]: Finished difference Result 336 states and 560 transitions. [2025-03-08 06:35:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:18,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-08 06:35:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:18,799 INFO L225 Difference]: With dead ends: 336 [2025-03-08 06:35:18,799 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 06:35:18,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:18,806 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 2 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:18,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 507 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:35:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 06:35:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-03-08 06:35:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 06:35:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2025-03-08 06:35:18,857 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 71 [2025-03-08 06:35:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:18,860 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2025-03-08 06:35:18,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2025-03-08 06:35:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:35:18,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:18,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:35:18,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2131192382, now seen corresponding path program 1 times [2025-03-08 06:35:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065529489] [2025-03-08 06:35:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:18,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:35:18,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:35:18,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:18,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065529489] [2025-03-08 06:35:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065529489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742370474] [2025-03-08 06:35:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:19,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:19,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:19,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:19,082 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:19,118 INFO L93 Difference]: Finished difference Result 330 states and 509 transitions. [2025-03-08 06:35:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-03-08 06:35:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:19,121 INFO L225 Difference]: With dead ends: 330 [2025-03-08 06:35:19,121 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 06:35:19,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:19,123 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:19,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 06:35:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-08 06:35:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 06:35:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-03-08 06:35:19,142 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 73 [2025-03-08 06:35:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:19,142 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-03-08 06:35:19,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-03-08 06:35:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:35:19,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:19,148 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:19,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:35:19,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:19,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -309403093, now seen corresponding path program 1 times [2025-03-08 06:35:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:19,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768888620] [2025-03-08 06:35:19,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:19,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:35:19,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:35:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768888620] [2025-03-08 06:35:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768888620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082099318] [2025-03-08 06:35:19,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:19,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:19,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:35:19,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:35:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:35:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:19,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:19,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:19,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082099318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:19,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:19,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:35:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006907204] [2025-03-08 06:35:19,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:19,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:19,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:19,789 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:19,828 INFO L93 Difference]: Finished difference Result 333 states and 513 transitions. [2025-03-08 06:35:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:35:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-03-08 06:35:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:19,830 INFO L225 Difference]: With dead ends: 333 [2025-03-08 06:35:19,830 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 06:35:19,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:19,833 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:19,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 06:35:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 06:35:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 06:35:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2025-03-08 06:35:19,850 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 74 [2025-03-08 06:35:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2025-03-08 06:35:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2025-03-08 06:35:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:35:19,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:19,852 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:19,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:20,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 981440651, now seen corresponding path program 2 times [2025-03-08 06:35:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578669062] [2025-03-08 06:35:20,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:20,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 06:35:20,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-03-08 06:35:20,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-08 06:35:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578669062] [2025-03-08 06:35:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578669062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111515156] [2025-03-08 06:35:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:20,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:20,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:20,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:20,283 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:20,332 INFO L93 Difference]: Finished difference Result 328 states and 511 transitions. [2025-03-08 06:35:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-03-08 06:35:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:20,335 INFO L225 Difference]: With dead ends: 328 [2025-03-08 06:35:20,335 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 06:35:20,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:20,339 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 217 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:20,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 906 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 06:35:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2025-03-08 06:35:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 187 states have (on average 1.4438502673796791) internal successors, (270), 187 states have internal predecessors, (270), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-03-08 06:35:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2025-03-08 06:35:20,376 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 76 [2025-03-08 06:35:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:20,377 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2025-03-08 06:35:20,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2025-03-08 06:35:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 06:35:20,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:20,382 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:20,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:20,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -607401186, now seen corresponding path program 1 times [2025-03-08 06:35:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072433507] [2025-03-08 06:35:20,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:20,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 06:35:20,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 06:35:20,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:20,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-08 06:35:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072433507] [2025-03-08 06:35:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072433507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854860744] [2025-03-08 06:35:20,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:20,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:20,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:20,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:35:20,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 06:35:20,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 06:35:20,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:20,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:20,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-08 06:35:20,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-08 06:35:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854860744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:21,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 06:35:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104088469] [2025-03-08 06:35:21,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:21,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:21,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:21,121 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 06:35:22,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:23,329 INFO L93 Difference]: Finished difference Result 599 states and 941 transitions. [2025-03-08 06:35:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 142 [2025-03-08 06:35:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:23,339 INFO L225 Difference]: With dead ends: 599 [2025-03-08 06:35:23,339 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 06:35:23,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:23,341 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:23,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 749 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 06:35:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 06:35:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-08 06:35:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 192 states have (on average 1.4375) internal successors, (276), 192 states have internal predecessors, (276), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-03-08 06:35:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 478 transitions. [2025-03-08 06:35:23,356 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 478 transitions. Word has length 142 [2025-03-08 06:35:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:23,356 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 478 transitions. [2025-03-08 06:35:23,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 06:35:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 478 transitions. [2025-03-08 06:35:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:35:23,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:23,358 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-03-08 06:35:23,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:35:23,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:23,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:23,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash 112888175, now seen corresponding path program 2 times [2025-03-08 06:35:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642238851] [2025-03-08 06:35:23,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:23,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-08 06:35:23,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 147 statements. [2025-03-08 06:35:23,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:23,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-08 06:35:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642238851] [2025-03-08 06:35:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642238851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:23,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:23,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248489223] [2025-03-08 06:35:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:23,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:23,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:23,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:23,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:23,730 INFO L87 Difference]: Start difference. First operand 306 states and 478 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:35:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:23,968 INFO L93 Difference]: Finished difference Result 866 states and 1366 transitions. [2025-03-08 06:35:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:23,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-08 06:35:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:23,975 INFO L225 Difference]: With dead ends: 866 [2025-03-08 06:35:23,975 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 06:35:23,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:23,978 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 238 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:23,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 835 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:35:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 06:35:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 585. [2025-03-08 06:35:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 361 states have (on average 1.443213296398892) internal successors, (521), 361 states have internal predecessors, (521), 191 states have call successors, (191), 32 states have call predecessors, (191), 32 states have return successors, (214), 191 states have call predecessors, (214), 191 states have call successors, (214) [2025-03-08 06:35:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 926 transitions. [2025-03-08 06:35:24,026 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 926 transitions. Word has length 147 [2025-03-08 06:35:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:24,027 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 926 transitions. [2025-03-08 06:35:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:35:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 926 transitions. [2025-03-08 06:35:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:35:24,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:24,032 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-03-08 06:35:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:24,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -683488757, now seen corresponding path program 1 times [2025-03-08 06:35:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741912684] [2025-03-08 06:35:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:24,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 06:35:24,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 06:35:24,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:24,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-08 06:35:24,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741912684] [2025-03-08 06:35:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741912684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103834063] [2025-03-08 06:35:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:24,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:24,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:24,472 INFO L87 Difference]: Start difference. First operand 585 states and 926 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:35:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:25,378 INFO L93 Difference]: Finished difference Result 1086 states and 1705 transitions. [2025-03-08 06:35:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-08 06:35:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:25,383 INFO L225 Difference]: With dead ends: 1086 [2025-03-08 06:35:25,383 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 06:35:25,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:25,385 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 234 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:25,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 836 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:35:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 06:35:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 512. [2025-03-08 06:35:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 318 states have (on average 1.3584905660377358) internal successors, (432), 317 states have internal predecessors, (432), 164 states have call successors, (164), 29 states have call predecessors, (164), 29 states have return successors, (179), 165 states have call predecessors, (179), 164 states have call successors, (179) [2025-03-08 06:35:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 775 transitions. [2025-03-08 06:35:25,418 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 775 transitions. Word has length 147 [2025-03-08 06:35:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:25,418 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 775 transitions. [2025-03-08 06:35:25,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:35:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 775 transitions. [2025-03-08 06:35:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:35:25,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:25,421 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 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] [2025-03-08 06:35:25,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:35:25,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:25,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash -17412305, now seen corresponding path program 1 times [2025-03-08 06:35:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:25,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811816789] [2025-03-08 06:35:25,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:25,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 06:35:25,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 06:35:25,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-08 06:35:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811816789] [2025-03-08 06:35:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811816789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088951673] [2025-03-08 06:35:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:25,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:25,996 INFO L87 Difference]: Start difference. First operand 512 states and 775 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:35:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:27,701 INFO L93 Difference]: Finished difference Result 559 states and 833 transitions. [2025-03-08 06:35:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-08 06:35:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:27,705 INFO L225 Difference]: With dead ends: 559 [2025-03-08 06:35:27,705 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 06:35:27,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:27,707 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 258 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:27,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1006 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:35:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 06:35:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2025-03-08 06:35:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 275 states have (on average 1.3636363636363635) internal successors, (375), 276 states have internal predecessors, (375), 132 states have call successors, (132), 25 states have call predecessors, (132), 27 states have return successors, (150), 133 states have call predecessors, (150), 132 states have call successors, (150) [2025-03-08 06:35:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2025-03-08 06:35:27,742 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 147 [2025-03-08 06:35:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:27,742 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2025-03-08 06:35:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:35:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2025-03-08 06:35:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 06:35:27,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:27,746 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 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] [2025-03-08 06:35:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:35:27,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2141158885, now seen corresponding path program 1 times [2025-03-08 06:35:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57364406] [2025-03-08 06:35:27,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:27,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 06:35:27,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 06:35:27,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:27,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-08 06:35:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57364406] [2025-03-08 06:35:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57364406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939079526] [2025-03-08 06:35:28,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:28,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:28,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:28,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:35:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 06:35:28,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 06:35:28,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:28,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:28,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:35:28,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 06:35:28,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-08 06:35:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939079526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:29,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:35:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276602017] [2025-03-08 06:35:29,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:29,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:35:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:29,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:35:29,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:35:29,099 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-08 06:35:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:29,972 INFO L93 Difference]: Finished difference Result 1083 states and 1667 transitions. [2025-03-08 06:35:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:35:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) Word has length 206 [2025-03-08 06:35:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:29,979 INFO L225 Difference]: With dead ends: 1083 [2025-03-08 06:35:29,979 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 06:35:29,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:35:29,984 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 395 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:29,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 938 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:35:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 06:35:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 666. [2025-03-08 06:35:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 415 states have (on average 1.3855421686746987) internal successors, (575), 418 states have internal predecessors, (575), 205 states have call successors, (205), 43 states have call predecessors, (205), 45 states have return successors, (237), 204 states have call predecessors, (237), 205 states have call successors, (237) [2025-03-08 06:35:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1017 transitions. [2025-03-08 06:35:30,043 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1017 transitions. Word has length 206 [2025-03-08 06:35:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:30,043 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1017 transitions. [2025-03-08 06:35:30,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-08 06:35:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1017 transitions. [2025-03-08 06:35:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 06:35:30,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:30,048 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 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] [2025-03-08 06:35:30,058 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-08 06:35:30,248 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-08 06:35:30,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 221840987, now seen corresponding path program 1 times [2025-03-08 06:35:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78509153] [2025-03-08 06:35:30,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:30,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 06:35:30,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 06:35:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-08 06:35:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78509153] [2025-03-08 06:35:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78509153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606405676] [2025-03-08 06:35:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:31,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:31,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:31,613 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-08 06:35:31,615 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-08 06:35:31,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 06:35:32,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 06:35:32,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:32,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:32,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 06:35:32,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:32,293 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-08 06:35:38,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:35:38,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:38,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-03-08 06:35:38,913 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-08 06:35:38,914 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 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 06:35:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 473 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 06:35:51,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:51,342 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 25 treesize of output 23 [2025-03-08 06:35:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-03-08 06:35:51,680 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 20 treesize of output 18 [2025-03-08 06:35:51,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-08 06:35:51,739 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 20 treesize of output 18 [2025-03-08 06:35:51,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-08 06:35:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-08 06:35:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606405676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:51,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-03-08 06:35:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853289304] [2025-03-08 06:35:51,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:51,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 06:35:51,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:51,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 06:35:51,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1193, Unknown=1, NotChecked=0, Total=1332 [2025-03-08 06:35:51,892 INFO L87 Difference]: Start difference. First operand 666 states and 1017 transitions. Second operand has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) [2025-03-08 06:35:53,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:58,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:02,801 INFO L93 Difference]: Finished difference Result 1310 states and 2048 transitions. [2025-03-08 06:36:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 06:36:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) Word has length 206 [2025-03-08 06:36:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:02,807 INFO L225 Difference]: With dead ends: 1310 [2025-03-08 06:36:02,807 INFO L226 Difference]: Without dead ends: 764 [2025-03-08 06:36:02,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 389 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=662, Invalid=3497, Unknown=1, NotChecked=0, Total=4160 [2025-03-08 06:36:02,811 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1364 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 3847 mSolverCounterSat, 1162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 5009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1162 IncrementalHoareTripleChecker+Valid, 3847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:02,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2839 Invalid, 5009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1162 Valid, 3847 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-03-08 06:36:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-08 06:36:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2025-03-08 06:36:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 445 states have (on average 1.3842696629213482) internal successors, (616), 451 states have internal predecessors, (616), 219 states have call successors, (219), 43 states have call predecessors, (219), 50 states have return successors, (276), 220 states have call predecessors, (276), 219 states have call successors, (276) [2025-03-08 06:36:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1111 transitions. [2025-03-08 06:36:02,888 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1111 transitions. Word has length 206 [2025-03-08 06:36:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1111 transitions. [2025-03-08 06:36:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) [2025-03-08 06:36:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1111 transitions. [2025-03-08 06:36:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 06:36:02,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:02,893 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 06:36:02,903 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-08 06:36:03,097 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-08 06:36:03,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:03,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 94454374, now seen corresponding path program 1 times [2025-03-08 06:36:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:03,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428669880] [2025-03-08 06:36:03,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:03,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 06:36:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 06:36:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-08 06:36:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428669880] [2025-03-08 06:36:05,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428669880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031883240] [2025-03-08 06:36:05,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:05,185 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-08 06:36:05,187 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-08 06:36:05,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 06:36:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 06:36:05,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:05,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 06:36:05,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:05,894 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 23 treesize of output 1 [2025-03-08 06:36:09,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:36:09,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:36:09,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-03-08 06:36:10,151 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-03-08 06:36:10,151 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 6 case distinctions, treesize of input 57 treesize of output 122 [2025-03-08 06:36:12,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:36:12,174 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 39 treesize of output 29 [2025-03-08 06:36:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 495 proven. 102 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 06:36:12,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:12,429 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 28 treesize of output 26 [2025-03-08 06:36:12,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 142 treesize of output 134 [2025-03-08 06:36:12,766 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 21 treesize of output 19 [2025-03-08 06:36:12,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 26 [2025-03-08 06:36:12,844 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 21 treesize of output 19 [2025-03-08 06:36:12,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 26 [2025-03-08 06:36:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-08 06:36:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031883240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:36:13,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:36:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 14] total 43 [2025-03-08 06:36:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953397893] [2025-03-08 06:36:13,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 06:36:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:13,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 06:36:13,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1633, Unknown=3, NotChecked=0, Total=1806 [2025-03-08 06:36:13,045 INFO L87 Difference]: Start difference. First operand 715 states and 1111 transitions. Second operand has 43 states, 38 states have (on average 4.631578947368421) internal successors, (176), 40 states have internal predecessors, (176), 22 states have call successors, (71), 13 states have call predecessors, (71), 16 states have return successors, (71), 19 states have call predecessors, (71), 22 states have call successors, (71) [2025-03-08 06:36:15,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:20,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:23,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:28,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:29,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:32,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:37,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:44,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]