./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.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 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:42:13,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:42:13,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:42:13,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:42:13,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:42:13,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:42:13,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:42:13,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:42:13,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:42:13,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:42:13,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:42:13,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:42:13,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:42:13,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:42:13,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:42:13,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:42:13,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:42:13,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:42:13,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:42:13,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:42:13,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:13,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:42:13,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:42:13,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:42:13,769 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 -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2025-03-08 16:42:13,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:42:14,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:42:14,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:42:14,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:42:14,006 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:42:14,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2025-03-08 16:42:15,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a68244e/cedc1fbce3894b08892b30c4c923892a/FLAGd7083c684 [2025-03-08 16:42:15,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:42:15,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2025-03-08 16:42:15,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a68244e/cedc1fbce3894b08892b30c4c923892a/FLAGd7083c684 [2025-03-08 16:42:15,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a68244e/cedc1fbce3894b08892b30c4c923892a [2025-03-08 16:42:15,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:42:15,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:42:15,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:15,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:42:15,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:42:15,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15, skipping insertion in model container [2025-03-08 16:42:15,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:42:15,804 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2025-03-08 16:42:15,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:15,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:42:15,864 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2025-03-08 16:42:15,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:15,906 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:42:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15 WrapperNode [2025-03-08 16:42:15,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:15,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:15,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:42:15,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:42:15,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,933 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 347 [2025-03-08 16:42:15,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:15,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:42:15,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:42:15,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:42:15,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,953 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2025-03-08 16:42:15,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:42:15,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:42:15,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:42:15,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:42:15,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (1/1) ... [2025-03-08 16:42:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:15,988 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 16:42:15,992 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 16:42:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:42:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:42:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:42:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:42:16,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:42:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:42:16,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:42:16,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:42:16,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:42:16,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2025-03-08 16:42:16,354 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-08 16:42:16,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:42:16,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:42:16,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:42:16,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:16 BoogieIcfgContainer [2025-03-08 16:42:16,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:42:16,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:42:16,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:42:16,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:42:16,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:42:15" (1/3) ... [2025-03-08 16:42:16,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a64a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:16, skipping insertion in model container [2025-03-08 16:42:16,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:15" (2/3) ... [2025-03-08 16:42:16,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a64a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:16, skipping insertion in model container [2025-03-08 16:42:16,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:16" (3/3) ... [2025-03-08 16:42:16,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2025-03-08 16:42:16,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:42:16,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-62.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:42:16,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:42:16,418 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;@4b275366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:42:16,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:42:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 16:42:16,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:16,426 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:16,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:16,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 796589395, now seen corresponding path program 1 times [2025-03-08 16:42:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101893281] [2025-03-08 16:42:16,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:16,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 16:42:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 16:42:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 16:42:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101893281] [2025-03-08 16:42:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101893281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919933131] [2025-03-08 16:42:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:16,638 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 16:42:16,640 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 16:42:16,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 16:42:16,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 16:42:16,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:16,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:16,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:42:16,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 16:42:16,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919933131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:42:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:42:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101842856] [2025-03-08 16:42:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:42:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:42:16,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:42:16,823 INFO L87 Difference]: Start difference. First operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 16:42:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:16,837 INFO L93 Difference]: Finished difference Result 138 states and 207 transitions. [2025-03-08 16:42:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:42:16,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-08 16:42:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:16,842 INFO L225 Difference]: With dead ends: 138 [2025-03-08 16:42:16,843 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 16:42:16,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:42:16,846 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:16,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 16:42:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 16:42:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-03-08 16:42:16,868 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2025-03-08 16:42:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-03-08 16:42:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 16:42:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-03-08 16:42:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 16:42:16,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:16,870 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:16,877 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 16:42:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:42:17,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1810307403, now seen corresponding path program 1 times [2025-03-08 16:42:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-03-08 16:42:17,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:17,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 16:42:17,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 16:42:17,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:17,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-03-08 16:42:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254770834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:17,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:17,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:17,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973382743] [2025-03-08 16:42:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:17,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:17,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:17,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:17,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:17,244 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:17,275 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2025-03-08 16:42:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-08 16:42:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:17,278 INFO L225 Difference]: With dead ends: 138 [2025-03-08 16:42:17,278 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 16:42:17,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:17,279 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:17,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 16:42:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-08 16:42:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-03-08 16:42:17,286 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2025-03-08 16:42:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:17,288 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-03-08 16:42:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-03-08 16:42:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 16:42:17,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:17,291 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:17,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:42:17,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:17,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1597156212, now seen corresponding path program 1 times [2025-03-08 16:42:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-03-08 16:42:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:17,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 16:42:17,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 16:42:17,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:17,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-03-08 16:42:17,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844225801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:17,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010568247] [2025-03-08 16:42:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:17,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:17,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:17,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:17,463 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:17,488 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2025-03-08 16:42:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-08 16:42:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:17,489 INFO L225 Difference]: With dead ends: 142 [2025-03-08 16:42:17,489 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 16:42:17,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:17,490 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:17,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 16:42:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-08 16:42:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-08 16:42:17,495 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2025-03-08 16:42:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:17,495 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-08 16:42:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-03-08 16:42:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 16:42:17,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:17,498 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:42:17,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1596232691, now seen corresponding path program 1 times [2025-03-08 16:42:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-08 16:42:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 16:42:17,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 16:42:17,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:17,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:17,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-08 16:42:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621155666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:17,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:17,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776686952] [2025-03-08 16:42:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:17,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:17,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:17,688 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:17,735 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2025-03-08 16:42:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-08 16:42:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:17,736 INFO L225 Difference]: With dead ends: 170 [2025-03-08 16:42:17,736 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 16:42:17,737 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 16:42:17,737 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 89 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:17,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 16:42:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2025-03-08 16:42:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2025-03-08 16:42:17,749 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 73 [2025-03-08 16:42:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:17,750 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2025-03-08 16:42:17,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2025-03-08 16:42:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 16:42:17,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:17,751 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:17,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:42:17,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:17,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1207500789, now seen corresponding path program 1 times [2025-03-08 16:42:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828005834] [2025-03-08 16:42:17,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 16:42:17,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 16:42:17,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:17,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:17,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828005834] [2025-03-08 16:42:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828005834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188839051] [2025-03-08 16:42:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:17,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:17,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:17,971 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:18,045 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2025-03-08 16:42:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-08 16:42:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:18,049 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:42:18,049 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 16:42:18,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:42:18,050 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 90 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:18,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 693 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 16:42:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 83. [2025-03-08 16:42:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-03-08 16:42:18,059 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2025-03-08 16:42:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:18,059 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-03-08 16:42:18,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-03-08 16:42:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 16:42:18,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:18,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:18,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:42:18,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:18,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1976622418, now seen corresponding path program 1 times [2025-03-08 16:42:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791077480] [2025-03-08 16:42:18,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:42:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:42:18,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:18,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791077480] [2025-03-08 16:42:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791077480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350260470] [2025-03-08 16:42:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:18,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:18,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:18,281 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:18,337 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2025-03-08 16:42:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-08 16:42:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:18,339 INFO L225 Difference]: With dead ends: 198 [2025-03-08 16:42:18,339 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 16:42:18,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:18,340 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:18,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 481 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 16:42:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2025-03-08 16:42:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-03-08 16:42:18,349 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 77 [2025-03-08 16:42:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:18,349 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-03-08 16:42:18,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-03-08 16:42:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 16:42:18,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:18,352 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:42:18,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1791990686, now seen corresponding path program 1 times [2025-03-08 16:42:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-08 16:42:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:18,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:42:18,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:42:18,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:18,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-08 16:42:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667241304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564347624] [2025-03-08 16:42:18,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:18,495 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 16:42:18,497 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 16:42:18,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:42:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:42:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:18,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:42:18,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:18,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564347624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:42:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:42:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230716010] [2025-03-08 16:42:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:18,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:18,669 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:18,695 INFO L93 Difference]: Finished difference Result 166 states and 227 transitions. [2025-03-08 16:42:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:18,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-08 16:42:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:18,696 INFO L225 Difference]: With dead ends: 166 [2025-03-08 16:42:18,697 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 16:42:18,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:18,698 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:18,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 16:42:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 16:42:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2025-03-08 16:42:18,708 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2025-03-08 16:42:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2025-03-08 16:42:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2025-03-08 16:42:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 16:42:18,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:18,709 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:18,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:42:18,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 16:42:18,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:18,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2110753112, now seen corresponding path program 1 times [2025-03-08 16:42:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772076588] [2025-03-08 16:42:18,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:18,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 16:42:18,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 16:42:18,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772076588] [2025-03-08 16:42:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772076588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:19,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175278297] [2025-03-08 16:42:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:19,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:19,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:19,064 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:19,115 INFO L93 Difference]: Finished difference Result 202 states and 271 transitions. [2025-03-08 16:42:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-08 16:42:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:19,116 INFO L225 Difference]: With dead ends: 202 [2025-03-08 16:42:19,116 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 16:42:19,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:19,117 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 367 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 16:42:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2025-03-08 16:42:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:42:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2025-03-08 16:42:19,123 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 77 [2025-03-08 16:42:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:19,123 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2025-03-08 16:42:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2025-03-08 16:42:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 16:42:19,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:19,125 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:42:19,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1792703627, now seen corresponding path program 1 times [2025-03-08 16:42:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-08 16:42:19,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:19,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 16:42:19,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 16:42:19,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:19,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:19,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:19,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-08 16:42:19,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234721430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:19,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496246644] [2025-03-08 16:42:19,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:19,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:19,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:19,577 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 16:42:19,579 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 16:42:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 16:42:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 16:42:19,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:19,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:19,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:42:19,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:19,879 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 15 treesize of output 1 [2025-03-08 16:42:19,959 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 17 treesize of output 9 [2025-03-08 16:42:19,963 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 15 treesize of output 7 [2025-03-08 16:42:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 16:42:19,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:42:20,037 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 13 [2025-03-08 16:42:20,158 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 32 treesize of output 28 [2025-03-08 16:42:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496246644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:42:20,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:42:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2025-03-08 16:42:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989501855] [2025-03-08 16:42:20,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:42:20,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:42:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:42:20,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:42:20,232 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 16:42:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:20,922 INFO L93 Difference]: Finished difference Result 308 states and 404 transitions. [2025-03-08 16:42:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 16:42:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 79 [2025-03-08 16:42:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:20,924 INFO L225 Difference]: With dead ends: 308 [2025-03-08 16:42:20,924 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 16:42:20,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 16:42:20,925 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 563 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:20,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1141 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:42:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 16:42:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 213. [2025-03-08 16:42:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2025-03-08 16:42:20,943 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 79 [2025-03-08 16:42:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:20,944 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2025-03-08 16:42:20,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.789473684210526) internal successors, (72), 21 states have internal predecessors, (72), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-08 16:42:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2025-03-08 16:42:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:20,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:20,946 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:20,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:42:21,146 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 16:42:21,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:21,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:21,147 INFO L85 PathProgramCache]: Analyzing trace with hash 542723288, now seen corresponding path program 1 times [2025-03-08 16:42:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974513571] [2025-03-08 16:42:21,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:21,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:21,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:21,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974513571] [2025-03-08 16:42:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974513571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479624873] [2025-03-08 16:42:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:21,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:21,226 INFO L87 Difference]: Start difference. First operand 213 states and 279 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:21,284 INFO L93 Difference]: Finished difference Result 481 states and 626 transitions. [2025-03-08 16:42:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:21,286 INFO L225 Difference]: With dead ends: 481 [2025-03-08 16:42:21,286 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 16:42:21,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:21,287 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 61 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:21,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 369 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 16:42:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2025-03-08 16:42:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 206 states have internal predecessors, (260), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2025-03-08 16:42:21,298 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 80 [2025-03-08 16:42:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2025-03-08 16:42:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2025-03-08 16:42:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:21,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:21,300 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:42:21,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2050275097, now seen corresponding path program 1 times [2025-03-08 16:42:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402443738] [2025-03-08 16:42:21,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:21,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:21,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:21,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:21,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402443738] [2025-03-08 16:42:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402443738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227226520] [2025-03-08 16:42:21,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:21,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:21,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:21,640 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 16:42:21,642 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 16:42:21,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:21,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:21,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:21,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:21,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 16:42:21,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:21,864 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 15 treesize of output 1 [2025-03-08 16:42:21,978 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 15 treesize of output 1 [2025-03-08 16:42:22,091 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 15 treesize of output 7 [2025-03-08 16:42:22,096 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 15 treesize of output 7 [2025-03-08 16:42:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 16:42:22,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:42:22,237 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 36 treesize of output 32 [2025-03-08 16:42:22,317 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 35 treesize of output 31 [2025-03-08 16:42:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227226520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:42:22,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:42:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-03-08 16:42:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282073351] [2025-03-08 16:42:22,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:42:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:42:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:22,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:42:22,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:42:22,381 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 16:42:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:22,767 INFO L93 Difference]: Finished difference Result 457 states and 589 transitions. [2025-03-08 16:42:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:42:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 80 [2025-03-08 16:42:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:22,769 INFO L225 Difference]: With dead ends: 457 [2025-03-08 16:42:22,769 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 16:42:22,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:42:22,770 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 332 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:22,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 443 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:42:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 16:42:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2025-03-08 16:42:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 204 states have (on average 1.2647058823529411) internal successors, (258), 206 states have internal predecessors, (258), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2025-03-08 16:42:22,779 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 80 [2025-03-08 16:42:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2025-03-08 16:42:22,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.684210526315789) internal successors, (89), 21 states have internal predecessors, (89), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 16:42:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2025-03-08 16:42:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:22,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:22,780 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:22,787 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 16:42:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:22,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2093465877, now seen corresponding path program 1 times [2025-03-08 16:42:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361633798] [2025-03-08 16:42:22,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:22,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:23,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:23,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361633798] [2025-03-08 16:42:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361633798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390537241] [2025-03-08 16:42:23,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:23,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:23,599 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 16:42:23,600 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 16:42:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:23,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:23,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:23,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 16:42:23,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:23,736 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 15 treesize of output 1 [2025-03-08 16:42:23,832 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 65 treesize of output 53 [2025-03-08 16:42:23,895 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 59 treesize of output 39 [2025-03-08 16:42:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:23,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:42:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390537241] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:42:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17, 11] total 23 [2025-03-08 16:42:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962126338] [2025-03-08 16:42:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:42:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:24,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:42:24,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:42:24,136 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:24,399 INFO L93 Difference]: Finished difference Result 465 states and 594 transitions. [2025-03-08 16:42:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:42:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:24,401 INFO L225 Difference]: With dead ends: 465 [2025-03-08 16:42:24,401 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 16:42:24,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:42:24,402 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 60 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:24,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 879 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 16:42:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 230. [2025-03-08 16:42:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 208 states have (on average 1.2596153846153846) internal successors, (262), 210 states have internal predecessors, (262), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 294 transitions. [2025-03-08 16:42:24,414 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 294 transitions. Word has length 80 [2025-03-08 16:42:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 294 transitions. [2025-03-08 16:42:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 294 transitions. [2025-03-08 16:42:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:24,415 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:24,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:42:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 16:42:24,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash -693949610, now seen corresponding path program 1 times [2025-03-08 16:42:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694502048] [2025-03-08 16:42:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:24,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:24,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694502048] [2025-03-08 16:42:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694502048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:24,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523571090] [2025-03-08 16:42:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:24,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:24,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:24,701 INFO L87 Difference]: Start difference. First operand 230 states and 294 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:24,770 INFO L93 Difference]: Finished difference Result 456 states and 582 transitions. [2025-03-08 16:42:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:24,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:24,772 INFO L225 Difference]: With dead ends: 456 [2025-03-08 16:42:24,772 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 16:42:24,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:42:24,773 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:24,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 537 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 16:42:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-03-08 16:42:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 195 states have (on average 1.2512820512820513) internal successors, (244), 197 states have internal predecessors, (244), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2025-03-08 16:42:24,786 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 80 [2025-03-08 16:42:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:24,786 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2025-03-08 16:42:24,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2025-03-08 16:42:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:24,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:24,787 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:42:24,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:24,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -956736938, now seen corresponding path program 1 times [2025-03-08 16:42:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722090220] [2025-03-08 16:42:24,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:24,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:24,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722090220] [2025-03-08 16:42:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722090220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796764469] [2025-03-08 16:42:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:24,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:24,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:24,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:24,870 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:24,954 INFO L93 Difference]: Finished difference Result 472 states and 600 transitions. [2025-03-08 16:42:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:42:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:24,957 INFO L225 Difference]: With dead ends: 472 [2025-03-08 16:42:24,957 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 16:42:24,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:24,960 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:24,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 554 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 16:42:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 217. [2025-03-08 16:42:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 195 states have (on average 1.2461538461538462) internal successors, (243), 197 states have internal predecessors, (243), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-03-08 16:42:24,974 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 80 [2025-03-08 16:42:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:24,974 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-03-08 16:42:24,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-03-08 16:42:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:24,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:24,977 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:42:24,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 550814871, now seen corresponding path program 1 times [2025-03-08 16:42:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-03-08 16:42:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:25,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973860005] [2025-03-08 16:42:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973860005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:42:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275014204] [2025-03-08 16:42:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:42:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:42:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:42:25,696 INFO L87 Difference]: Start difference. First operand 217 states and 275 transitions. Second operand has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 16:42:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:26,475 INFO L93 Difference]: Finished difference Result 880 states and 1104 transitions. [2025-03-08 16:42:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:42:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2025-03-08 16:42:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:26,478 INFO L225 Difference]: With dead ends: 880 [2025-03-08 16:42:26,479 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 16:42:26,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 16:42:26,480 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 773 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:26,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1268 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:42:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 16:42:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 395. [2025-03-08 16:42:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 354 states have (on average 1.2401129943502824) internal successors, (439), 357 states have internal predecessors, (439), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:42:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 499 transitions. [2025-03-08 16:42:26,498 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 499 transitions. Word has length 80 [2025-03-08 16:42:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:26,498 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 499 transitions. [2025-03-08 16:42:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 16:42:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 499 transitions. [2025-03-08 16:42:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:26,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:26,499 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:42:26,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1952889544, now seen corresponding path program 1 times [2025-03-08 16:42:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-08 16:42:26,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:26,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:26,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:26,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:26,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-08 16:42:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63283295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736612973] [2025-03-08 16:42:26,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:26,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:42:26,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:42:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:26,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:26,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:26,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:26,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:42:26,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:26,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:26,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736612973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:26,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:42:26,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:42:26,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502296982] [2025-03-08 16:42:26,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:26,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:26,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:26,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:42:26,699 INFO L87 Difference]: Start difference. First operand 395 states and 499 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:26,731 INFO L93 Difference]: Finished difference Result 807 states and 1020 transitions. [2025-03-08 16:42:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:26,733 INFO L225 Difference]: With dead ends: 807 [2025-03-08 16:42:26,735 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 16:42:26,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:42:26,736 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:26,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 16:42:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 400. [2025-03-08 16:42:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 359 states have (on average 1.2367688022284122) internal successors, (444), 362 states have internal predecessors, (444), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:42:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 504 transitions. [2025-03-08 16:42:26,756 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 504 transitions. Word has length 80 [2025-03-08 16:42:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:26,757 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 504 transitions. [2025-03-08 16:42:26,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 504 transitions. [2025-03-08 16:42:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 16:42:26,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:26,758 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:26,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:42:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 16:42:26,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 735479975, now seen corresponding path program 1 times [2025-03-08 16:42:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667458604] [2025-03-08 16:42:26,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:26,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 16:42:26,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 16:42:26,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:26,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667458604] [2025-03-08 16:42:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667458604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025509834] [2025-03-08 16:42:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:27,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:27,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:27,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:27,062 INFO L87 Difference]: Start difference. First operand 400 states and 504 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:27,128 INFO L93 Difference]: Finished difference Result 801 states and 1008 transitions. [2025-03-08 16:42:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-08 16:42:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:27,130 INFO L225 Difference]: With dead ends: 801 [2025-03-08 16:42:27,130 INFO L226 Difference]: Without dead ends: 404 [2025-03-08 16:42:27,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:42:27,131 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 53 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:27,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-08 16:42:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 359. [2025-03-08 16:42:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 320 states have (on average 1.221875) internal successors, (391), 322 states have internal predecessors, (391), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:42:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 447 transitions. [2025-03-08 16:42:27,157 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 447 transitions. Word has length 80 [2025-03-08 16:42:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:27,157 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 447 transitions. [2025-03-08 16:42:27,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 447 transitions. [2025-03-08 16:42:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:42:27,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:27,158 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:27,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:42:27,158 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:27,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash -788634455, now seen corresponding path program 1 times [2025-03-08 16:42:27,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:27,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131753519] [2025-03-08 16:42:27,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:27,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:42:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:42:27,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 16:42:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131753519] [2025-03-08 16:42:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131753519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:27,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513868019] [2025-03-08 16:42:27,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:27,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:42:27,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:42:27,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:42:27,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:42:27,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:27,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:27,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 16:42:27,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:27,957 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 15 treesize of output 1 [2025-03-08 16:42:27,990 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 15 treesize of output 1 [2025-03-08 16:42:28,065 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 57 treesize of output 45 [2025-03-08 16:42:28,107 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 49 treesize of output 29 [2025-03-08 16:42:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 16:42:28,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:42:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513868019] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:42:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 10] total 24 [2025-03-08 16:42:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719533209] [2025-03-08 16:42:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:42:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:28,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:42:28,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:42:28,308 INFO L87 Difference]: Start difference. First operand 359 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:28,563 INFO L93 Difference]: Finished difference Result 885 states and 1100 transitions. [2025-03-08 16:42:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:42:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2025-03-08 16:42:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:28,565 INFO L225 Difference]: With dead ends: 885 [2025-03-08 16:42:28,565 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 16:42:28,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:42:28,567 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:28,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 942 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 16:42:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 175. [2025-03-08 16:42:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 156 states have internal predecessors, (189), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:42:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 217 transitions. [2025-03-08 16:42:28,577 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 217 transitions. Word has length 81 [2025-03-08 16:42:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:28,578 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 217 transitions. [2025-03-08 16:42:28,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 217 transitions. [2025-03-08 16:42:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 16:42:28,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:28,579 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:28,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:42:28,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:28,783 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -858535626, now seen corresponding path program 1 times [2025-03-08 16:42:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209862030] [2025-03-08 16:42:28,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 16:42:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 16:42:28,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209862030] [2025-03-08 16:42:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209862030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:28,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045524103] [2025-03-08 16:42:28,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:28,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:28,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:28,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:28,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:28,864 INFO L87 Difference]: Start difference. First operand 175 states and 217 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:28,905 INFO L93 Difference]: Finished difference Result 419 states and 520 transitions. [2025-03-08 16:42:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-08 16:42:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:28,906 INFO L225 Difference]: With dead ends: 419 [2025-03-08 16:42:28,906 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 16:42:28,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:28,907 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 325 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 16:42:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 175. [2025-03-08 16:42:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.206451612903226) internal successors, (187), 156 states have internal predecessors, (187), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:42:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 215 transitions. [2025-03-08 16:42:28,917 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 215 transitions. Word has length 82 [2025-03-08 16:42:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 215 transitions. [2025-03-08 16:42:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 215 transitions. [2025-03-08 16:42:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:42:28,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:28,918 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:28,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:42:28,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:28,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1378705283, now seen corresponding path program 1 times [2025-03-08 16:42:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-08 16:42:28,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:28,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:42:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:42:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-08 16:42:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184314546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:29,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:42:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290593425] [2025-03-08 16:42:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:42:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:29,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:42:29,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:42:29,149 INFO L87 Difference]: Start difference. First operand 175 states and 215 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 16:42:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:29,367 INFO L93 Difference]: Finished difference Result 477 states and 580 transitions. [2025-03-08 16:42:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:42:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-03-08 16:42:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:29,371 INFO L225 Difference]: With dead ends: 477 [2025-03-08 16:42:29,371 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 16:42:29,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:42:29,372 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 280 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:29,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 578 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 16:42:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2025-03-08 16:42:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.1897233201581028) internal successors, (301), 256 states have internal predecessors, (301), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:42:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 345 transitions. [2025-03-08 16:42:29,399 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 345 transitions. Word has length 83 [2025-03-08 16:42:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:29,399 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 345 transitions. [2025-03-08 16:42:29,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 16:42:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 345 transitions. [2025-03-08 16:42:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:42:29,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:29,400 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:42:29,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1622723162, now seen corresponding path program 1 times [2025-03-08 16:42:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968939762] [2025-03-08 16:42:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:29,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:42:29,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:42:29,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:29,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968939762] [2025-03-08 16:42:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968939762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:29,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476730146] [2025-03-08 16:42:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:29,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:29,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:29,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:29,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:29,477 INFO L87 Difference]: Start difference. First operand 285 states and 345 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:29,523 INFO L93 Difference]: Finished difference Result 699 states and 852 transitions. [2025-03-08 16:42:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-03-08 16:42:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:29,525 INFO L225 Difference]: With dead ends: 699 [2025-03-08 16:42:29,525 INFO L226 Difference]: Without dead ends: 417 [2025-03-08 16:42:29,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:29,527 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:29,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 324 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-08 16:42:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 305. [2025-03-08 16:42:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 273 states have (on average 1.1758241758241759) internal successors, (321), 276 states have internal predecessors, (321), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:42:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 365 transitions. [2025-03-08 16:42:29,545 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 365 transitions. Word has length 83 [2025-03-08 16:42:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:29,545 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 365 transitions. [2025-03-08 16:42:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 365 transitions. [2025-03-08 16:42:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 16:42:29,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:29,546 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:29,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:42:29,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:29,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1671497532, now seen corresponding path program 1 times [2025-03-08 16:42:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:29,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226109162] [2025-03-08 16:42:29,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:29,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 16:42:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 16:42:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226109162] [2025-03-08 16:42:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226109162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161581226] [2025-03-08 16:42:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:29,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:29,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:29,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:29,600 INFO L87 Difference]: Start difference. First operand 305 states and 365 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:29,675 INFO L93 Difference]: Finished difference Result 697 states and 834 transitions. [2025-03-08 16:42:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-03-08 16:42:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:29,677 INFO L225 Difference]: With dead ends: 697 [2025-03-08 16:42:29,677 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 16:42:29,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:29,679 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 43 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:29,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 432 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 16:42:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 331. [2025-03-08 16:42:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 302 states have internal predecessors, (349), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 16:42:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 393 transitions. [2025-03-08 16:42:29,698 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 393 transitions. Word has length 83 [2025-03-08 16:42:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:29,698 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 393 transitions. [2025-03-08 16:42:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 393 transitions. [2025-03-08 16:42:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 16:42:29,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:29,699 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:42:29,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1297475480, now seen corresponding path program 1 times [2025-03-08 16:42:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627701233] [2025-03-08 16:42:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:29,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 16:42:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 16:42:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:30,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627701233] [2025-03-08 16:42:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627701233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:30,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:30,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399323036] [2025-03-08 16:42:30,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:30,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:30,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:30,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:30,017 INFO L87 Difference]: Start difference. First operand 331 states and 393 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:30,117 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2025-03-08 16:42:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-03-08 16:42:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:30,119 INFO L225 Difference]: With dead ends: 387 [2025-03-08 16:42:30,119 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 16:42:30,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:42:30,119 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 64 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:30,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 491 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 16:42:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380. [2025-03-08 16:42:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.1492537313432836) internal successors, (385), 339 states have internal predecessors, (385), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:42:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 445 transitions. [2025-03-08 16:42:30,143 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 445 transitions. Word has length 85 [2025-03-08 16:42:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 445 transitions. [2025-03-08 16:42:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 445 transitions. [2025-03-08 16:42:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 16:42:30,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:30,145 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:42:30,145 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:30,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1298399001, now seen corresponding path program 1 times [2025-03-08 16:42:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:30,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879230955] [2025-03-08 16:42:30,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:30,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 16:42:30,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 16:42:30,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:30,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879230955] [2025-03-08 16:42:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879230955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161620216] [2025-03-08 16:42:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:30,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:30,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:30,221 INFO L87 Difference]: Start difference. First operand 380 states and 445 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:30,289 INFO L93 Difference]: Finished difference Result 724 states and 850 transitions. [2025-03-08 16:42:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-03-08 16:42:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:30,291 INFO L225 Difference]: With dead ends: 724 [2025-03-08 16:42:30,291 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 16:42:30,292 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 16:42:30,292 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:30,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 358 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 16:42:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 221. [2025-03-08 16:42:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.1398963730569949) internal successors, (220), 195 states have internal predecessors, (220), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 256 transitions. [2025-03-08 16:42:30,319 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 256 transitions. Word has length 85 [2025-03-08 16:42:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 256 transitions. [2025-03-08 16:42:30,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 256 transitions. [2025-03-08 16:42:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 16:42:30,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:30,320 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:30,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:42:30,320 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2109064614, now seen corresponding path program 1 times [2025-03-08 16:42:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688015819] [2025-03-08 16:42:30,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:30,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 16:42:30,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 16:42:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:30,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688015819] [2025-03-08 16:42:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688015819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311442691] [2025-03-08 16:42:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:30,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:30,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:30,528 INFO L87 Difference]: Start difference. First operand 221 states and 256 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:30,621 INFO L93 Difference]: Finished difference Result 540 states and 628 transitions. [2025-03-08 16:42:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:30,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-03-08 16:42:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:30,623 INFO L225 Difference]: With dead ends: 540 [2025-03-08 16:42:30,623 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 16:42:30,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:42:30,624 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 37 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:30,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 384 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 16:42:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 305. [2025-03-08 16:42:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.1407942238267148) internal successors, (316), 279 states have internal predecessors, (316), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 352 transitions. [2025-03-08 16:42:30,646 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 352 transitions. Word has length 85 [2025-03-08 16:42:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:30,646 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 352 transitions. [2025-03-08 16:42:30,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 352 transitions. [2025-03-08 16:42:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 16:42:30,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:30,647 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:42:30,647 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1299644720, now seen corresponding path program 1 times [2025-03-08 16:42:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605355166] [2025-03-08 16:42:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:30,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 16:42:30,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 16:42:30,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:30,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605355166] [2025-03-08 16:42:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605355166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24177493] [2025-03-08 16:42:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:30,730 INFO L87 Difference]: Start difference. First operand 305 states and 352 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:30,786 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2025-03-08 16:42:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 86 [2025-03-08 16:42:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:30,787 INFO L225 Difference]: With dead ends: 636 [2025-03-08 16:42:30,787 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 16:42:30,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:30,788 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:30,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 418 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 16:42:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2025-03-08 16:42:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.1213389121338913) internal successors, (268), 241 states have internal predecessors, (268), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 304 transitions. [2025-03-08 16:42:30,807 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 304 transitions. Word has length 86 [2025-03-08 16:42:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:30,807 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 304 transitions. [2025-03-08 16:42:30,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 304 transitions. [2025-03-08 16:42:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 16:42:30,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:30,808 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:30,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:42:30,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1440258089, now seen corresponding path program 1 times [2025-03-08 16:42:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673625283] [2025-03-08 16:42:30,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:30,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 16:42:30,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 16:42:30,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:30,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:30,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673625283] [2025-03-08 16:42:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673625283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:30,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:30,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739736423] [2025-03-08 16:42:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:30,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:30,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:30,872 INFO L87 Difference]: Start difference. First operand 267 states and 304 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:30,915 INFO L93 Difference]: Finished difference Result 443 states and 506 transitions. [2025-03-08 16:42:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:30,916 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), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2025-03-08 16:42:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:30,917 INFO L225 Difference]: With dead ends: 443 [2025-03-08 16:42:30,917 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 16:42:30,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:30,917 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:30,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 16:42:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 16:42:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2025-03-08 16:42:30,934 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 87 [2025-03-08 16:42:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:30,934 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2025-03-08 16:42:30,934 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), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2025-03-08 16:42:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 16:42:30,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:30,936 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:30,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:42:30,936 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash 664147580, now seen corresponding path program 1 times [2025-03-08 16:42:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440420365] [2025-03-08 16:42:30,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:30,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 16:42:30,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 16:42:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440420365] [2025-03-08 16:42:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440420365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:31,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828215790] [2025-03-08 16:42:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:31,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:31,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:31,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:31,004 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:31,073 INFO L93 Difference]: Finished difference Result 459 states and 518 transitions. [2025-03-08 16:42:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2025-03-08 16:42:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:31,075 INFO L225 Difference]: With dead ends: 459 [2025-03-08 16:42:31,075 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 16:42:31,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:31,075 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:31,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 273 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 16:42:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2025-03-08 16:42:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 235 states have (on average 1.102127659574468) internal successors, (259), 237 states have internal predecessors, (259), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2025-03-08 16:42:31,093 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 87 [2025-03-08 16:42:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:31,093 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2025-03-08 16:42:31,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2025-03-08 16:42:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 16:42:31,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:31,094 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:31,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:42:31,094 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1322410454, now seen corresponding path program 1 times [2025-03-08 16:42:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140083844] [2025-03-08 16:42:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:31,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 16:42:31,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 16:42:31,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:31,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140083844] [2025-03-08 16:42:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140083844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:42:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286202286] [2025-03-08 16:42:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:31,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:42:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:31,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:42:31,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:31,368 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 16:42:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:31,511 INFO L93 Difference]: Finished difference Result 506 states and 569 transitions. [2025-03-08 16:42:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:42:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2025-03-08 16:42:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:31,513 INFO L225 Difference]: With dead ends: 506 [2025-03-08 16:42:31,513 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 16:42:31,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:42:31,514 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:31,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 360 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 16:42:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2025-03-08 16:42:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.1012658227848102) internal successors, (261), 239 states have internal predecessors, (261), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:42:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 297 transitions. [2025-03-08 16:42:31,530 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 297 transitions. Word has length 88 [2025-03-08 16:42:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:31,531 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 297 transitions. [2025-03-08 16:42:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 16:42:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 297 transitions. [2025-03-08 16:42:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 16:42:31,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:31,531 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:42:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:42:31,531 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681267, now seen corresponding path program 1 times [2025-03-08 16:42:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396279738] [2025-03-08 16:42:31,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:31,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 16:42:31,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 16:42:31,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:31,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:42:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396279738] [2025-03-08 16:42:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396279738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029632363] [2025-03-08 16:42:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:31,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:31,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:31,595 INFO L87 Difference]: Start difference. First operand 265 states and 297 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:31,670 INFO L93 Difference]: Finished difference Result 498 states and 554 transitions. [2025-03-08 16:42:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90 [2025-03-08 16:42:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:31,671 INFO L225 Difference]: With dead ends: 498 [2025-03-08 16:42:31,671 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 16:42:31,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:31,672 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:31,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 354 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 16:42:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 16:42:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 16:42:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 16:42:31,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2025-03-08 16:42:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 16:42:31,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 16:42:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 16:42:31,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 16:42:31,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:42:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:42:31,678 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:42:31,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 16:42:47,964 WARN L286 SmtUtils]: Spent 15.07s on a formula simplification. DAG size of input: 209 DAG size of output: 204 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-08 16:42:50,930 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:42:50,937 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-08 16:42:50,937 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-08 16:42:50,937 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,938 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-08 16:42:50,938 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-08 16:42:50,938 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,938 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-08 16:42:50,938 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-08 16:42:50,939 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-08 16:42:50,940 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2025-03-08 16:42:50,941 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2025-03-08 16:42:50,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:42:50 BoogieIcfgContainer [2025-03-08 16:42:50,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:42:50,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:42:50,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:42:50,942 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:42:50,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:16" (3/4) ... [2025-03-08 16:42:50,944 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 16:42:50,948 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 16:42:50,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 16:42:50,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 16:42:50,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 16:42:50,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 16:42:51,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 16:42:51,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 16:42:51,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:42:51,033 INFO L158 Benchmark]: Toolchain (without parser) took 35335.56ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 104.7MB in the beginning and 541.2MB in the end (delta: -436.6MB). Peak memory consumption was 265.5MB. Max. memory is 16.1GB. [2025-03-08 16:42:51,033 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:51,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 91.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:42:51,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:51,033 INFO L158 Benchmark]: Boogie Preprocessor took 28.82ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:51,033 INFO L158 Benchmark]: IcfgBuilder took 398.99ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 59.1MB in the end (delta: 27.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:42:51,036 INFO L158 Benchmark]: TraceAbstraction took 34576.60ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 59.1MB in the beginning and 549.6MB in the end (delta: -490.5MB). Peak memory consumption was 454.2MB. Max. memory is 16.1GB. [2025-03-08 16:42:51,036 INFO L158 Benchmark]: Witness Printer took 90.80ms. Allocated memory is still 847.2MB. Free memory was 549.6MB in the beginning and 541.2MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:51,037 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 91.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.82ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 398.99ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 59.1MB in the end (delta: 27.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34576.60ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 59.1MB in the beginning and 549.6MB in the end (delta: -490.5MB). Peak memory consumption was 454.2MB. Max. memory is 16.1GB. * Witness Printer took 90.80ms. Allocated memory is still 847.2MB. Free memory was 549.6MB in the beginning and 541.2MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 30, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3033 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3033 mSDsluCounter, 14243 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11100 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3625 IncrementalHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 3143 mSDtfsCounter, 3625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 899 SyntacticMatches, 1 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=16, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 1562 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2972 NumberOfCodeBlocks, 2972 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3251 ConstructedInterpolants, 0 QuantifiedInterpolants, 12477 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 41 InterpolantComputations, 28 PerfectInterpolantSequences, 4282/4592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 16:42:51,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE