./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-87.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 d1558071458a9b20d19a0574bae4bc888f78db92e0ff6316a4aff911aa1d4e26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:51:25,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:51:26,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:51:26,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:51:26,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:51:26,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:51:26,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:51:26,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:51:26,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:51:26,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:51:26,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:51:26,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:51:26,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:51:26,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:51:26,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:51:26,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:51:26,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:51:26,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:51:26,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:51:26,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:51:26,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:51:26,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:51:26,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:51:26,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:51:26,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:51:26,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:51:26,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:51:26,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:51:26,051 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 -> d1558071458a9b20d19a0574bae4bc888f78db92e0ff6316a4aff911aa1d4e26 [2025-03-17 05:51:26,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:51:26,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:51:26,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:51:26,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:51:26,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:51:26,305 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-87.i [2025-03-17 05:51:27,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef97afb8/fae39378d74549f39d2c1fa25e35c0a0/FLAG9aecc5dc0 [2025-03-17 05:51:27,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:51:27,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-87.i [2025-03-17 05:51:27,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef97afb8/fae39378d74549f39d2c1fa25e35c0a0/FLAG9aecc5dc0 [2025-03-17 05:51:28,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef97afb8/fae39378d74549f39d2c1fa25e35c0a0 [2025-03-17 05:51:28,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:51:28,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:51:28,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:51:28,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:51:28,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:51:28,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28, skipping insertion in model container [2025-03-17 05:51:28,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:51:28,188 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-87.i[916,929] [2025-03-17 05:51:28,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:51:28,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:51:28,262 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-87.i[916,929] [2025-03-17 05:51:28,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:51:28,311 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:51:28,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28 WrapperNode [2025-03-17 05:51:28,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:51:28,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:51:28,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:51:28,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:51:28,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,359 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2025-03-17 05:51:28,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:51:28,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:51:28,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:51:28,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:51:28,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,405 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 3, 12, 16, 7, 10, 12, 16, 12, 8, 5, 5, 6, 5]. 13 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1]. [2025-03-17 05:51:28,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:51:28,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:51:28,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:51:28,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:51:28,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (1/1) ... [2025-03-17 05:51:28,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:51:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:28,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:51:28,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:51:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:51:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:51:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:51:28,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:51:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:51:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:51:28,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:51:28,641 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:51:28,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:51:28,960 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite67#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~ite88#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-03-17 05:51:28,995 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-17 05:51:28,995 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:51:29,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:51:29,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:51:29,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:51:29 BoogieIcfgContainer [2025-03-17 05:51:29,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:51:29,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:51:29,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:51:29,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:51:29,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:51:28" (1/3) ... [2025-03-17 05:51:29,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a019bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:51:29, skipping insertion in model container [2025-03-17 05:51:29,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:51:28" (2/3) ... [2025-03-17 05:51:29,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a019bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:51:29, skipping insertion in model container [2025-03-17 05:51:29,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:51:29" (3/3) ... [2025-03-17 05:51:29,013 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-87.i [2025-03-17 05:51:29,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:51:29,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-87.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:51:29,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:51:29,079 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;@6bdd7908, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:51:29,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:51:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 64 states have (on average 1.390625) internal successors, (89), 65 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:51:29,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:29,092 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:29,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1680585208, now seen corresponding path program 1 times [2025-03-17 05:51:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736162883] [2025-03-17 05:51:29,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:29,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:29,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:29,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:51:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736162883] [2025-03-17 05:51:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736162883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627801900] [2025-03-17 05:51:29,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:29,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:29,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:29,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:51:29,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:29,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:51:29,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:51:29,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627801900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:51:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387890830] [2025-03-17 05:51:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:29,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:51:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:51:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:51:29,674 INFO L87 Difference]: Start difference. First operand has 81 states, 64 states have (on average 1.390625) internal successors, (89), 65 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:51:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:29,696 INFO L93 Difference]: Finished difference Result 159 states and 246 transitions. [2025-03-17 05:51:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:51:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2025-03-17 05:51:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:29,702 INFO L225 Difference]: With dead ends: 159 [2025-03-17 05:51:29,702 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 05:51:29,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:51:29,706 INFO L435 NwaCegarLoop]: 111 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, 111 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-17 05:51:29,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 05:51:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 05:51:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2025-03-17 05:51:29,745 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 107 [2025-03-17 05:51:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:29,745 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2025-03-17 05:51:29,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:51:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2025-03-17 05:51:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:51:29,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:29,751 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:29,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:51:29,952 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-17 05:51:29,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1403710506, now seen corresponding path program 1 times [2025-03-17 05:51:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904552859] [2025-03-17 05:51:29,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:29,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:30,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:30,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:30,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904552859] [2025-03-17 05:51:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904552859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580260482] [2025-03-17 05:51:30,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:30,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:30,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:30,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:51:30,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:30,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:30,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:30,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:51:30,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:30,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580260482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:51:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82547537] [2025-03-17 05:51:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:30,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:30,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:30,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:30,572 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:30,612 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2025-03-17 05:51:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:30,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:51:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:30,614 INFO L225 Difference]: With dead ends: 160 [2025-03-17 05:51:30,614 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 05:51:30,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:30,615 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 313 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-17 05:51:30,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 313 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 05:51:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-17 05:51:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2025-03-17 05:51:30,624 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 107 [2025-03-17 05:51:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2025-03-17 05:51:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2025-03-17 05:51:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:51:30,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:30,627 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:30,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:51:30,828 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,SelfDestructingSolverStorable1 [2025-03-17 05:51:30,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1083802327, now seen corresponding path program 1 times [2025-03-17 05:51:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237046765] [2025-03-17 05:51:30,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:30,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:30,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:30,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:30,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:31,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237046765] [2025-03-17 05:51:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237046765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465739840] [2025-03-17 05:51:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:31,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:31,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:51:31,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:51:31,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:31,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465739840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:31,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:31,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:51:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012303554] [2025-03-17 05:51:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:31,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:31,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:31,261 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:31,287 INFO L93 Difference]: Finished difference Result 164 states and 229 transitions. [2025-03-17 05:51:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:31,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:51:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:31,292 INFO L225 Difference]: With dead ends: 164 [2025-03-17 05:51:31,295 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 05:51:31,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:31,296 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:31,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 05:51:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-03-17 05:51:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2025-03-17 05:51:31,306 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 107 [2025-03-17 05:51:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:31,308 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2025-03-17 05:51:31,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2025-03-17 05:51:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:51:31,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:31,310 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:31,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:51:31,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:31,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1971306008, now seen corresponding path program 1 times [2025-03-17 05:51:31,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:31,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014166979] [2025-03-17 05:51:31,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:31,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:31,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:31,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014166979] [2025-03-17 05:51:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014166979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770200111] [2025-03-17 05:51:31,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:31,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:31,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:31,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:51:31,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:31,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:31,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:51:31,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:31,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770200111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:51:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543420583] [2025-03-17 05:51:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:31,890 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:31,926 INFO L93 Difference]: Finished difference Result 168 states and 233 transitions. [2025-03-17 05:51:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:31,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:51:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:31,928 INFO L225 Difference]: With dead ends: 168 [2025-03-17 05:51:31,928 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 05:51:31,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:31,929 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 316 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-17 05:51:31,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 316 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 05:51:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-17 05:51:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-03-17 05:51:31,935 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 107 [2025-03-17 05:51:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:31,936 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-03-17 05:51:31,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-03-17 05:51:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:51:31,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:31,937 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:31,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:51:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:32,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1972229529, now seen corresponding path program 1 times [2025-03-17 05:51:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972986932] [2025-03-17 05:51:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:32,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:32,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:32,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:32,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972986932] [2025-03-17 05:51:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972986932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:32,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778795403] [2025-03-17 05:51:32,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:32,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:32,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:51:32,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:51:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:51:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:32,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:51:32,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:32,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778795403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:32,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:51:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798361619] [2025-03-17 05:51:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:32,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:51:32,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:32,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:51:32,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:32,498 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:32,524 INFO L93 Difference]: Finished difference Result 171 states and 236 transitions. [2025-03-17 05:51:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:51:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-17 05:51:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:32,526 INFO L225 Difference]: With dead ends: 171 [2025-03-17 05:51:32,526 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:51:32,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:32,527 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:32,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:51:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 05:51:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-17 05:51:32,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 107 [2025-03-17 05:51:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-17 05:51:32,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-17 05:51:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:51:32,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:32,534 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:32,544 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-17 05:51:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:32,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:32,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2106448054, now seen corresponding path program 1 times [2025-03-17 05:51:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629680566] [2025-03-17 05:51:32,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:32,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:51:32,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:51:32,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629680566] [2025-03-17 05:51:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629680566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:33,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428315580] [2025-03-17 05:51:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:33,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:33,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:33,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:33,013 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:33,116 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2025-03-17 05:51:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:51:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:33,118 INFO L225 Difference]: With dead ends: 252 [2025-03-17 05:51:33,120 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 05:51:33,120 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-17 05:51:33,121 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 97 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:33,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 525 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 05:51:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 99. [2025-03-17 05:51:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:51:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-03-17 05:51:33,134 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 109 [2025-03-17 05:51:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:33,134 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-03-17 05:51:33,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-03-17 05:51:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:51:33,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:33,135 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:33,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:51:33,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:33,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1504652525, now seen corresponding path program 1 times [2025-03-17 05:51:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958280029] [2025-03-17 05:51:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:33,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:51:33,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:51:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958280029] [2025-03-17 05:51:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958280029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397563155] [2025-03-17 05:51:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:33,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:33,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:33,395 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:33,507 INFO L93 Difference]: Finished difference Result 269 states and 369 transitions. [2025-03-17 05:51:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:33,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2025-03-17 05:51:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:33,509 INFO L225 Difference]: With dead ends: 269 [2025-03-17 05:51:33,509 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 05:51:33,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:33,510 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 73 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:33,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 620 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 05:51:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2025-03-17 05:51:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 144 states have internal predecessors, (186), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:51:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2025-03-17 05:51:33,522 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 109 [2025-03-17 05:51:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:33,523 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2025-03-17 05:51:33,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2025-03-17 05:51:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:51:33,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:33,524 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:51:33,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1881511865, now seen corresponding path program 1 times [2025-03-17 05:51:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171500740] [2025-03-17 05:51:33,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:33,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:51:33,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:51:33,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:33,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171500740] [2025-03-17 05:51:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171500740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:34,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:51:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110422188] [2025-03-17 05:51:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:51:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:34,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:51:34,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:34,003 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:34,177 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2025-03-17 05:51:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:34,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:51:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:34,180 INFO L225 Difference]: With dead ends: 397 [2025-03-17 05:51:34,181 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 05:51:34,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:34,182 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:34,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 941 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 05:51:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 176. [2025-03-17 05:51:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 150 states have internal predecessors, (190), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:51:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2025-03-17 05:51:34,202 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 110 [2025-03-17 05:51:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2025-03-17 05:51:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2025-03-17 05:51:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:34,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:34,204 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:34,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:51:34,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash -995670829, now seen corresponding path program 1 times [2025-03-17 05:51:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:34,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901202866] [2025-03-17 05:51:34,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:34,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901202866] [2025-03-17 05:51:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901202866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:51:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299835205] [2025-03-17 05:51:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:51:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:34,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:51:34,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:51:34,763 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:34,908 INFO L93 Difference]: Finished difference Result 418 states and 560 transitions. [2025-03-17 05:51:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:51:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:34,913 INFO L225 Difference]: With dead ends: 418 [2025-03-17 05:51:34,913 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 05:51:34,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:34,914 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 55 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:34,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 962 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 05:51:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 172. [2025-03-17 05:51:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 146 states have internal predecessors, (184), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:51:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2025-03-17 05:51:34,925 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 111 [2025-03-17 05:51:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2025-03-17 05:51:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2025-03-17 05:51:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:34,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:34,930 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:34,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:51:34,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:34,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1993447498, now seen corresponding path program 1 times [2025-03-17 05:51:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487909434] [2025-03-17 05:51:34,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:34,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:34,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:34,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:34,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:35,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487909434] [2025-03-17 05:51:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487909434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:35,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620476284] [2025-03-17 05:51:35,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:35,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:35,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:35,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:35,143 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:35,208 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2025-03-17 05:51:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:51:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:35,210 INFO L225 Difference]: With dead ends: 339 [2025-03-17 05:51:35,210 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 05:51:35,210 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-17 05:51:35,211 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:35,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 382 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 05:51:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2025-03-17 05:51:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 135 states have internal predecessors, (169), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:51:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2025-03-17 05:51:35,222 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 111 [2025-03-17 05:51:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2025-03-17 05:51:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2025-03-17 05:51:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:35,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:35,224 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:51:35,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1070183068, now seen corresponding path program 1 times [2025-03-17 05:51:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780964857] [2025-03-17 05:51:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:35,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:35,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:35,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:35,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:35,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780964857] [2025-03-17 05:51:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780964857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413407952] [2025-03-17 05:51:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:35,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:35,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:35,747 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:35,988 INFO L93 Difference]: Finished difference Result 198 states and 259 transitions. [2025-03-17 05:51:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:51:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2025-03-17 05:51:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:35,991 INFO L225 Difference]: With dead ends: 198 [2025-03-17 05:51:35,992 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 05:51:35,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:51:35,992 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 150 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:35,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 604 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 05:51:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2025-03-17 05:51:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 158 states have internal predecessors, (191), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:51:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2025-03-17 05:51:36,014 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 111 [2025-03-17 05:51:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2025-03-17 05:51:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2025-03-17 05:51:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:36,018 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:51:36,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1069259547, now seen corresponding path program 1 times [2025-03-17 05:51:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936616522] [2025-03-17 05:51:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:36,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:36,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:36,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:36,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:36,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936616522] [2025-03-17 05:51:36,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936616522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:36,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:36,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:51:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630426425] [2025-03-17 05:51:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:36,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:51:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:36,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:51:36,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:51:36,680 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:37,007 INFO L93 Difference]: Finished difference Result 490 states and 631 transitions. [2025-03-17 05:51:37,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:51:37,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2025-03-17 05:51:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:37,010 INFO L225 Difference]: With dead ends: 490 [2025-03-17 05:51:37,010 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 05:51:37,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:51:37,011 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 320 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:37,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 714 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 05:51:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2025-03-17 05:51:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 257 states have internal predecessors, (302), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:51:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 406 transitions. [2025-03-17 05:51:37,036 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 406 transitions. Word has length 111 [2025-03-17 05:51:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:37,037 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 406 transitions. [2025-03-17 05:51:37,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 406 transitions. [2025-03-17 05:51:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:37,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:37,038 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:37,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:51:37,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:37,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash -181755866, now seen corresponding path program 1 times [2025-03-17 05:51:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119895087] [2025-03-17 05:51:37,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:37,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:37,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119895087] [2025-03-17 05:51:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119895087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107847090] [2025-03-17 05:51:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:37,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:37,175 INFO L87 Difference]: Start difference. First operand 317 states and 406 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:37,282 INFO L93 Difference]: Finished difference Result 621 states and 787 transitions. [2025-03-17 05:51:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:51:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:37,285 INFO L225 Difference]: With dead ends: 621 [2025-03-17 05:51:37,285 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 05:51:37,286 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-17 05:51:37,286 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:37,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 291 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 05:51:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 239. [2025-03-17 05:51:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.1875) internal successors, (228), 194 states have internal predecessors, (228), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:51:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 300 transitions. [2025-03-17 05:51:37,311 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 300 transitions. Word has length 111 [2025-03-17 05:51:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:37,311 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 300 transitions. [2025-03-17 05:51:37,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 300 transitions. [2025-03-17 05:51:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:51:37,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:37,313 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:37,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:51:37,313 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:37,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1989210329, now seen corresponding path program 1 times [2025-03-17 05:51:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:37,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438381933] [2025-03-17 05:51:37,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:37,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:51:37,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:51:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438381933] [2025-03-17 05:51:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438381933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:51:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754652377] [2025-03-17 05:51:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:37,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:37,536 INFO L87 Difference]: Start difference. First operand 239 states and 300 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:37,656 INFO L93 Difference]: Finished difference Result 593 states and 735 transitions. [2025-03-17 05:51:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:51:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-17 05:51:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:37,658 INFO L225 Difference]: With dead ends: 593 [2025-03-17 05:51:37,658 INFO L226 Difference]: Without dead ends: 383 [2025-03-17 05:51:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:37,659 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 569 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-17 05:51:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2025-03-17 05:51:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 316 states have (on average 1.1740506329113924) internal successors, (371), 320 states have internal predecessors, (371), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:51:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 467 transitions. [2025-03-17 05:51:37,688 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 467 transitions. Word has length 111 [2025-03-17 05:51:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:37,689 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 467 transitions. [2025-03-17 05:51:37,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 467 transitions. [2025-03-17 05:51:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:51:37,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:37,690 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:37,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:51:37,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -512215920, now seen corresponding path program 1 times [2025-03-17 05:51:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899308314] [2025-03-17 05:51:37,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:37,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:51:37,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:51:37,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:37,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:37,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899308314] [2025-03-17 05:51:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899308314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350693536] [2025-03-17 05:51:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:37,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:37,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:37,864 INFO L87 Difference]: Start difference. First operand 379 states and 467 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:38,005 INFO L93 Difference]: Finished difference Result 1053 states and 1299 transitions. [2025-03-17 05:51:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:51:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:38,009 INFO L225 Difference]: With dead ends: 1053 [2025-03-17 05:51:38,009 INFO L226 Difference]: Without dead ends: 703 [2025-03-17 05:51:38,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:38,010 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 102 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:38,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1057 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-17 05:51:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 683. [2025-03-17 05:51:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 570 states have (on average 1.1666666666666667) internal successors, (665), 578 states have internal predecessors, (665), 86 states have call successors, (86), 26 states have call predecessors, (86), 26 states have return successors, (86), 78 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:51:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 837 transitions. [2025-03-17 05:51:38,072 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 837 transitions. Word has length 112 [2025-03-17 05:51:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:38,072 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 837 transitions. [2025-03-17 05:51:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 837 transitions. [2025-03-17 05:51:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:51:38,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:38,074 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:38,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:51:38,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1498893079, now seen corresponding path program 1 times [2025-03-17 05:51:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168753917] [2025-03-17 05:51:38,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:51:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:51:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:38,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168753917] [2025-03-17 05:51:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168753917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631980873] [2025-03-17 05:51:38,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:38,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:38,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:38,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:51:38,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:51:38,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:51:38,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:38,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:38,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:51:38,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:38,905 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-17 05:51:38,955 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 19 treesize of output 11 [2025-03-17 05:51:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:51:38,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:39,124 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-17 05:51:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631980873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:39,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2025-03-17 05:51:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176266463] [2025-03-17 05:51:39,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:51:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:51:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:51:39,261 INFO L87 Difference]: Start difference. First operand 683 states and 837 transitions. Second operand has 14 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 05:51:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:39,796 INFO L93 Difference]: Finished difference Result 1046 states and 1280 transitions. [2025-03-17 05:51:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:51:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) Word has length 112 [2025-03-17 05:51:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:39,799 INFO L225 Difference]: With dead ends: 1046 [2025-03-17 05:51:39,800 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 05:51:39,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:51:39,803 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 220 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:39,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 685 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 05:51:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 381. [2025-03-17 05:51:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.1666666666666667) internal successors, (364), 316 states have internal predecessors, (364), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:51:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 468 transitions. [2025-03-17 05:51:39,836 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 468 transitions. Word has length 112 [2025-03-17 05:51:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:39,836 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 468 transitions. [2025-03-17 05:51:39,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-17 05:51:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 468 transitions. [2025-03-17 05:51:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:51:39,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:39,838 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:39,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:40,038 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-17 05:51:40,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1498202686, now seen corresponding path program 1 times [2025-03-17 05:51:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005394731] [2025-03-17 05:51:40,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:40,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:51:40,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:51:40,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005394731] [2025-03-17 05:51:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005394731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:40,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:40,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:40,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099912952] [2025-03-17 05:51:40,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:40,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:40,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:40,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:51:40,193 INFO L87 Difference]: Start difference. First operand 381 states and 468 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:40,285 INFO L93 Difference]: Finished difference Result 729 states and 893 transitions. [2025-03-17 05:51:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:40,285 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:51:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:40,287 INFO L225 Difference]: With dead ends: 729 [2025-03-17 05:51:40,287 INFO L226 Difference]: Without dead ends: 381 [2025-03-17 05:51:40,288 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-17 05:51:40,288 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:40,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 278 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-17 05:51:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-17 05:51:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.1474358974358974) internal successors, (358), 316 states have internal predecessors, (358), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:51:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 462 transitions. [2025-03-17 05:51:40,321 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 462 transitions. Word has length 113 [2025-03-17 05:51:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 462 transitions. [2025-03-17 05:51:40,322 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 462 transitions. [2025-03-17 05:51:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:51:40,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:40,323 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:51:40,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -96491745, now seen corresponding path program 1 times [2025-03-17 05:51:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574329870] [2025-03-17 05:51:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:40,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:51:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:51:40,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:40,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574329870] [2025-03-17 05:51:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574329870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666972033] [2025-03-17 05:51:40,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:40,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:40,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:40,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:40,786 INFO L87 Difference]: Start difference. First operand 381 states and 462 transitions. Second operand has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:41,120 INFO L93 Difference]: Finished difference Result 738 states and 888 transitions. [2025-03-17 05:51:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:51:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-17 05:51:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:41,123 INFO L225 Difference]: With dead ends: 738 [2025-03-17 05:51:41,123 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 05:51:41,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:51:41,124 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 204 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:41,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 592 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 05:51:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2025-03-17 05:51:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 314 states have (on average 1.1337579617834395) internal successors, (356), 318 states have internal predecessors, (356), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:51:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 458 transitions. [2025-03-17 05:51:41,170 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 458 transitions. Word has length 115 [2025-03-17 05:51:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:41,170 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 458 transitions. [2025-03-17 05:51:41,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 458 transitions. [2025-03-17 05:51:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:51:41,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:41,172 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:41,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:51:41,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:41,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash -243410505, now seen corresponding path program 1 times [2025-03-17 05:51:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:41,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144566190] [2025-03-17 05:51:41,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:41,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:51:41,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:51:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:41,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:51:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638321295] [2025-03-17 05:51:41,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:41,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:41,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:51:41,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:51:41,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:51:41,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:41,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:41,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 05:51:41,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:41,608 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-17 05:51:41,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 05:51:41,944 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-17 05:51:42,112 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 27 treesize of output 19 [2025-03-17 05:51:42,117 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 23 treesize of output 15 [2025-03-17 05:51:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:51:42,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:42,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144566190] [2025-03-17 05:51:42,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:51:42,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638321295] [2025-03-17 05:51:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638321295] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:42,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-17 05:51:42,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126212156] [2025-03-17 05:51:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:42,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:42,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:42,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:42,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:42,370 INFO L87 Difference]: Start difference. First operand 383 states and 458 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:42,571 INFO L93 Difference]: Finished difference Result 829 states and 984 transitions. [2025-03-17 05:51:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:42,572 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-17 05:51:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:42,575 INFO L225 Difference]: With dead ends: 829 [2025-03-17 05:51:42,575 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 05:51:42,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:51:42,577 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:42,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 357 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 05:51:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 431. [2025-03-17 05:51:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 362 states have (on average 1.132596685082873) internal successors, (410), 366 states have internal predecessors, (410), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:51:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 512 transitions. [2025-03-17 05:51:42,622 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 512 transitions. Word has length 116 [2025-03-17 05:51:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:42,622 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 512 transitions. [2025-03-17 05:51:42,622 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 512 transitions. [2025-03-17 05:51:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:51:42,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:42,625 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:42,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:51:42,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:42,826 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:42,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1003985667, now seen corresponding path program 1 times [2025-03-17 05:51:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:42,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138230616] [2025-03-17 05:51:42,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:42,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:51:42,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:51:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:51:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820726990] [2025-03-17 05:51:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:42,903 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:42,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:51:43,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:51:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:51:43,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:43,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 05:51:43,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:43,302 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-17 05:51:43,487 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-17 05:51:43,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-17 05:51:44,230 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 11 [2025-03-17 05:51:44,383 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 05:51:44,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2025-03-17 05:51:44,549 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 38 treesize of output 26 [2025-03-17 05:51:44,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-17 05:51:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 4 proven. 264 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 05:51:44,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138230616] [2025-03-17 05:51:44,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:51:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820726990] [2025-03-17 05:51:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820726990] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-03-17 05:51:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741983696] [2025-03-17 05:51:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:44,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:51:44,959 INFO L87 Difference]: Start difference. First operand 431 states and 512 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:45,376 INFO L93 Difference]: Finished difference Result 890 states and 1048 transitions. [2025-03-17 05:51:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 05:51:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:45,379 INFO L225 Difference]: With dead ends: 890 [2025-03-17 05:51:45,379 INFO L226 Difference]: Without dead ends: 492 [2025-03-17 05:51:45,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:51:45,380 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:45,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 391 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-17 05:51:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 432. [2025-03-17 05:51:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 363 states have (on average 1.1322314049586777) internal successors, (411), 367 states have internal predecessors, (411), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 05:51:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 513 transitions. [2025-03-17 05:51:45,408 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 513 transitions. Word has length 117 [2025-03-17 05:51:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:45,408 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 513 transitions. [2025-03-17 05:51:45,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 513 transitions. [2025-03-17 05:51:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:51:45,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:45,409 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:45,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 05:51:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:45,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:45,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 858416601, now seen corresponding path program 1 times [2025-03-17 05:51:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243281259] [2025-03-17 05:51:45,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:45,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:45,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:45,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:45,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243281259] [2025-03-17 05:51:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243281259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782859642] [2025-03-17 05:51:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:45,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:45,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:45,819 INFO L87 Difference]: Start difference. First operand 432 states and 513 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:45,957 INFO L93 Difference]: Finished difference Result 859 states and 1014 transitions. [2025-03-17 05:51:45,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:45,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-17 05:51:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:45,960 INFO L225 Difference]: With dead ends: 859 [2025-03-17 05:51:45,960 INFO L226 Difference]: Without dead ends: 460 [2025-03-17 05:51:45,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:45,961 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 61 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:45,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 814 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-17 05:51:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2025-03-17 05:51:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 381 states have (on average 1.125984251968504) internal successors, (429), 385 states have internal predecessors, (429), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 539 transitions. [2025-03-17 05:51:45,991 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 539 transitions. Word has length 118 [2025-03-17 05:51:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:45,992 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 539 transitions. [2025-03-17 05:51:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 539 transitions. [2025-03-17 05:51:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:51:45,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:45,993 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:45,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:51:45,993 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 565013594, now seen corresponding path program 1 times [2025-03-17 05:51:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542146960] [2025-03-17 05:51:45,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:46,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:46,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:46,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:51:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544841914] [2025-03-17 05:51:46,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:46,069 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:46,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 05:51:46,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:46,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:46,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:46,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 05:51:46,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:46,843 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-17 05:51:46,878 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-17 05:51:46,895 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 11 [2025-03-17 05:51:46,990 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 42 treesize of output 30 [2025-03-17 05:51:46,995 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 27 treesize of output 19 [2025-03-17 05:51:46,997 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 30 treesize of output 18 [2025-03-17 05:51:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:51:47,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542146960] [2025-03-17 05:51:47,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:51:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544841914] [2025-03-17 05:51:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544841914] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:47,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 05:51:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623720347] [2025-03-17 05:51:47,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:47,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:47,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:47,166 INFO L87 Difference]: Start difference. First operand 456 states and 539 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:47,314 INFO L93 Difference]: Finished difference Result 875 states and 1028 transitions. [2025-03-17 05:51:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-17 05:51:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:47,317 INFO L225 Difference]: With dead ends: 875 [2025-03-17 05:51:47,317 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 05:51:47,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:47,322 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 98 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:47,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 347 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 05:51:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2025-03-17 05:51:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 373 states have (on average 1.1179624664879357) internal successors, (417), 377 states have internal predecessors, (417), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 527 transitions. [2025-03-17 05:51:47,354 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 527 transitions. Word has length 118 [2025-03-17 05:51:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:47,355 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 527 transitions. [2025-03-17 05:51:47,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 527 transitions. [2025-03-17 05:51:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:51:47,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:47,357 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:47,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:47,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:47,558 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:47,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1218792742, now seen corresponding path program 1 times [2025-03-17 05:51:47,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:47,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647585045] [2025-03-17 05:51:47,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:51:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018181451] [2025-03-17 05:51:47,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:47,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:47,625 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:47,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 05:51:47,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:47,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:47,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 05:51:47,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:48,299 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-17 05:51:48,330 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-17 05:51:48,348 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 11 [2025-03-17 05:51:48,440 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 44 treesize of output 32 [2025-03-17 05:51:48,443 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 40 treesize of output 24 [2025-03-17 05:51:48,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-17 05:51:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:51:48,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647585045] [2025-03-17 05:51:48,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:51:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018181451] [2025-03-17 05:51:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018181451] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 05:51:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031359453] [2025-03-17 05:51:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:51:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:48,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:51:48,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:48,585 INFO L87 Difference]: Start difference. First operand 448 states and 527 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:48,765 INFO L93 Difference]: Finished difference Result 967 states and 1130 transitions. [2025-03-17 05:51:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:51:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-17 05:51:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:48,769 INFO L225 Difference]: With dead ends: 967 [2025-03-17 05:51:48,769 INFO L226 Difference]: Without dead ends: 552 [2025-03-17 05:51:48,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:51:48,770 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 57 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:48,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 483 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:51:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-17 05:51:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 450. [2025-03-17 05:51:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 375 states have (on average 1.1173333333333333) internal successors, (419), 379 states have internal predecessors, (419), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 529 transitions. [2025-03-17 05:51:48,804 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 529 transitions. Word has length 118 [2025-03-17 05:51:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:48,805 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 529 transitions. [2025-03-17 05:51:48,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 529 transitions. [2025-03-17 05:51:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:51:48,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:48,806 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:48,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:49,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 05:51:49,007 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1512195749, now seen corresponding path program 1 times [2025-03-17 05:51:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101039023] [2025-03-17 05:51:49,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:49,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:51:49,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:51:49,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101039023] [2025-03-17 05:51:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101039023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:51:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097349694] [2025-03-17 05:51:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:51:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:49,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:51:49,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:51:49,169 INFO L87 Difference]: Start difference. First operand 450 states and 529 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:49,267 INFO L93 Difference]: Finished difference Result 877 states and 1026 transitions. [2025-03-17 05:51:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-17 05:51:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:49,270 INFO L225 Difference]: With dead ends: 877 [2025-03-17 05:51:49,270 INFO L226 Difference]: Without dead ends: 460 [2025-03-17 05:51:49,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:49,271 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 684 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:51:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-17 05:51:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 452. [2025-03-17 05:51:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 377 states have (on average 1.1167108753315649) internal successors, (421), 381 states have internal predecessors, (421), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 531 transitions. [2025-03-17 05:51:49,303 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 531 transitions. Word has length 118 [2025-03-17 05:51:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:49,303 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 531 transitions. [2025-03-17 05:51:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 531 transitions. [2025-03-17 05:51:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:51:49,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:49,304 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:49,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:51:49,304 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2004712179, now seen corresponding path program 1 times [2025-03-17 05:51:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310862154] [2025-03-17 05:51:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:49,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:51:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:51:49,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310862154] [2025-03-17 05:51:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310862154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:51:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269726684] [2025-03-17 05:51:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:49,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:51:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:51:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:51:49,984 INFO L87 Difference]: Start difference. First operand 452 states and 531 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:50,639 INFO L93 Difference]: Finished difference Result 919 states and 1068 transitions. [2025-03-17 05:51:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:51:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-03-17 05:51:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:50,642 INFO L225 Difference]: With dead ends: 919 [2025-03-17 05:51:50,642 INFO L226 Difference]: Without dead ends: 500 [2025-03-17 05:51:50,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:51:50,643 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 242 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:50,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 602 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:51:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-17 05:51:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 452. [2025-03-17 05:51:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 377 states have (on average 1.1087533156498675) internal successors, (418), 381 states have internal predecessors, (418), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 528 transitions. [2025-03-17 05:51:50,686 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 528 transitions. Word has length 120 [2025-03-17 05:51:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:50,686 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 528 transitions. [2025-03-17 05:51:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:51:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 528 transitions. [2025-03-17 05:51:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:51:50,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:50,688 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:51:50,688 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -739597491, now seen corresponding path program 1 times [2025-03-17 05:51:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096435409] [2025-03-17 05:51:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:50,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:51:50,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:51:50,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:50,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:51:50,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:50,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096435409] [2025-03-17 05:51:50,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096435409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:50,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:50,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:51:50,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679372154] [2025-03-17 05:51:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:51,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:51:51,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:51,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:51:51,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:51,001 INFO L87 Difference]: Start difference. First operand 452 states and 528 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:51,259 INFO L93 Difference]: Finished difference Result 838 states and 969 transitions. [2025-03-17 05:51:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:51:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-17 05:51:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:51,262 INFO L225 Difference]: With dead ends: 838 [2025-03-17 05:51:51,262 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 05:51:51,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:51:51,263 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 240 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:51,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 585 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:51:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 05:51:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2025-03-17 05:51:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 342 states have (on average 1.0818713450292399) internal successors, (370), 346 states have internal predecessors, (370), 55 states have call successors, (55), 19 states have call predecessors, (55), 19 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:51:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 480 transitions. [2025-03-17 05:51:51,299 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 480 transitions. Word has length 120 [2025-03-17 05:51:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:51,299 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 480 transitions. [2025-03-17 05:51:51,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:51:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 480 transitions. [2025-03-17 05:51:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:51:51,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:51,301 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:51,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:51:51,302 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -688559732, now seen corresponding path program 1 times [2025-03-17 05:51:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:51:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61018247] [2025-03-17 05:51:51,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:51:51,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:51:51,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:51:51,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:51:51,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61018247] [2025-03-17 05:51:51,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61018247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:51,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495139811] [2025-03-17 05:51:51,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:51,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:51:51,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:51:51,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:51:51,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 05:51:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:51:51,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:51:51,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:51,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:51:51,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:52,006 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-17 05:51:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-17 05:51:52,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:52,393 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-17 05:51:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:51:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495139811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:51:52,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:51:52,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 21 [2025-03-17 05:51:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513964546] [2025-03-17 05:51:52,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:51:52,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:51:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:51:52,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:51:52,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:51:52,417 INFO L87 Difference]: Start difference. First operand 417 states and 480 transitions. Second operand has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 9 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-17 05:51:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:53,128 INFO L93 Difference]: Finished difference Result 591 states and 665 transitions. [2025-03-17 05:51:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:51:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 9 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) Word has length 120 [2025-03-17 05:51:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:53,129 INFO L225 Difference]: With dead ends: 591 [2025-03-17 05:51:53,129 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:51:53,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 05:51:53,130 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 254 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 309 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:51:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:51:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:51:53,132 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-17 05:51:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:51:53,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2025-03-17 05:51:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:51:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 9 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 7 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-17 05:51:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:51:53,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:51:53,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:51:53,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 05:51:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 05:51:53,338 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] [2025-03-17 05:51:53,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 05:52:00,302 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:52:00,309 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset [2025-03-17 05:52:00,310 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset [2025-03-17 05:52:00,310 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,311 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,311 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,311 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#11 [2025-03-17 05:52:00,311 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] [2025-03-17 05:52:00,311 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~#var_1_14~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#13 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset [2025-03-17 05:52:00,313 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#11 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem58 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem58 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,314 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem58 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~var_1_3_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-17 05:52:00,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#13 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#11 [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,317 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_12_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,318 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~#var_1_8~0!base,GLOBAL]]] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~var_1_3_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,319 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#12 [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~#var_1_14~0!base,GLOBAL]]] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#13 [2025-03-17 05:52:00,320 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#13 [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,321 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2025-03-17 05:52:00,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2025-03-17 05:52:00,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2025-03-17 05:52:00,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2025-03-17 05:52:00,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2025-03-17 05:52:00,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:52:00 BoogieIcfgContainer [2025-03-17 05:52:00,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:52:00,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:52:00,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:52:00,323 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:52:00,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:51:29" (3/4) ... [2025-03-17 05:52:00,325 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 05:52:00,329 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 05:52:00,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 05:52:00,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 05:52:00,335 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 05:52:00,336 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 05:52:00,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 05:52:00,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 05:52:00,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:52:00,467 INFO L158 Benchmark]: Toolchain (without parser) took 32422.33ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 106.9MB in the beginning and 120.4MB in the end (delta: -13.4MB). Peak memory consumption was 144.5MB. Max. memory is 16.1GB. [2025-03-17 05:52:00,467 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 100.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:52:00,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.87ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.2MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:52:00,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.69ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:52:00,468 INFO L158 Benchmark]: Boogie Preprocessor took 72.90ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:52:00,468 INFO L158 Benchmark]: IcfgBuilder took 569.22ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.7MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:52:00,468 INFO L158 Benchmark]: TraceAbstraction took 31314.19ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 56.0MB in the beginning and 376.5MB in the end (delta: -320.5MB). Peak memory consumption was 287.9MB. Max. memory is 16.1GB. [2025-03-17 05:52:00,468 INFO L158 Benchmark]: Witness Printer took 143.93ms. Allocated memory was 545.3MB in the beginning and 167.8MB in the end (delta: -377.5MB). Free memory was 376.5MB in the beginning and 120.4MB in the end (delta: 256.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-03-17 05:52:00,469 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.23ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 100.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.87ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 93.2MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.69ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.90ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 569.22ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.7MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31314.19ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 56.0MB in the beginning and 376.5MB in the end (delta: -320.5MB). Peak memory consumption was 287.9MB. Max. memory is 16.1GB. * Witness Printer took 143.93ms. Allocated memory was 545.3MB in the beginning and 167.8MB in the end (delta: -377.5MB). Free memory was 376.5MB in the beginning and 120.4MB in the end (delta: 256.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base - 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#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_12_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_8_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_8~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_8~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base - 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#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~#var_1_14~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: #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_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#13 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_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_7_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_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem58 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem58 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem58 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base - 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#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_12_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_8_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_8~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~var_1_3_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_8~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base - 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: #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_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#13 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_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_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_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_12_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_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_12_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#11,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#11,GLOBAL],[IdentifierExpression[~var_1_13_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~var_1_14_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_14~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_14_Pointer~0!base - 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#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_12_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_8_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_8~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_8~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~var_1_3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - 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#12 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#12,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#12,GLOBAL],[IdentifierExpression[~#var_1_14~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: #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_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#13 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_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_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_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#13 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#13,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#13,GLOBAL],[IdentifierExpression[~var_1_15_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_9_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_9~0!offset - 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_9_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_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_8_Pointer~0!base,GLOBAL]]] * 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, 81 locations, 131 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 27, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2794 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2794 mSDsluCounter, 14162 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10770 mSDsCounter, 345 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3257 IncrementalHoareTripleChecker+Invalid, 3602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 345 mSolverCounterUnsat, 3392 mSDtfsCounter, 3257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2191 GetRequests, 1916 SyntacticMatches, 4 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=15, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 625 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 4282 NumberOfCodeBlocks, 4282 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4474 ConstructedInterpolants, 91 QuantifiedInterpolants, 17906 SizeOfPredicates, 89 NumberOfNonLiveVariables, 5481 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 40 InterpolantComputations, 25 PerfectInterpolantSequences, 13130/14560 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-17 05:52:00,525 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