./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res2o.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res2o.c -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 c8f420e2027982da4f1bb18a6387f830c2a1e2f24637d0451d3246965ba37a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:48:21,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:48:21,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:48:21,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:48:21,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:48:21,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:48:21,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:48:21,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:48:21,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:48:21,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:48:21,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:48:21,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:48:21,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:48:21,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:48:21,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:48:21,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:48:21,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:48:21,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:21,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:48:21,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:48:21,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:48:21,462 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 -> c8f420e2027982da4f1bb18a6387f830c2a1e2f24637d0451d3246965ba37a6d [2025-03-08 00:48:21,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:48:21,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:48:21,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:48:21,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:48:21,681 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:48:21,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2o.c [2025-03-08 00:48:22,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb1b1041/b50feea2f1584757b067fc7d599d97ba/FLAG111234550 [2025-03-08 00:48:23,086 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:48:23,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2o.c [2025-03-08 00:48:23,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb1b1041/b50feea2f1584757b067fc7d599d97ba/FLAG111234550 [2025-03-08 00:48:23,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb1b1041/b50feea2f1584757b067fc7d599d97ba [2025-03-08 00:48:23,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:48:23,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:48:23,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:23,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:48:23,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:48:23,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393fd840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23, skipping insertion in model container [2025-03-08 00:48:23,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:48:23,243 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/array-fpi/res2o.c[588,601] [2025-03-08 00:48:23,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:23,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:48:23,281 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/array-fpi/res2o.c[588,601] [2025-03-08 00:48:23,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:23,304 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:48:23,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23 WrapperNode [2025-03-08 00:48:23,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:23,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:23,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:48:23,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:48:23,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,335 INFO L138 Inliner]: procedures = 17, calls = 37, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2025-03-08 00:48:23,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:23,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:48:23,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:48:23,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:48:23,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,358 INFO L175 MemorySlicer]: Split 24 memory accesses to 6 slices as follows [2, 8, 2, 2, 2, 8]. 33 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 1, 1, 1, 4]. [2025-03-08 00:48:23,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:48:23,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:48:23,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:48:23,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:48:23,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (1/1) ... [2025-03-08 00:48:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:23,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:48:23,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:48:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:48:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:48:23,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 00:48:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:48:23,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:48:23,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:48:23,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:48:23,621 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:48:23,621 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:48:23,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:48:23,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:48:23,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:23 BoogieIcfgContainer [2025-03-08 00:48:23,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:48:23,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:48:23,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:48:23,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:48:23,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:48:23" (1/3) ... [2025-03-08 00:48:23,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113b3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:23, skipping insertion in model container [2025-03-08 00:48:23,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:23" (2/3) ... [2025-03-08 00:48:23,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113b3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:23, skipping insertion in model container [2025-03-08 00:48:23,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:23" (3/3) ... [2025-03-08 00:48:23,638 INFO L128 eAbstractionObserver]: Analyzing ICFG res2o.c [2025-03-08 00:48:23,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:48:23,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG res2o.c that has 1 procedures, 18 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 00:48:23,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:48:23,710 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;@2872c2ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:48:23,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:48:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:48:23,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:23,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:23,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:23,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash -966007917, now seen corresponding path program 1 times [2025-03-08 00:48:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283583888] [2025-03-08 00:48:23,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:23,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:23,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:23,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283583888] [2025-03-08 00:48:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283583888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:23,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:23,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:48:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607195266] [2025-03-08 00:48:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:48:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:48:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:48:23,871 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:23,881 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-03-08 00:48:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:48:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:48:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:23,886 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:48:23,886 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:48:23,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:48:23,889 INFO L435 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:23,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:48:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 00:48:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-08 00:48:23,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 13 [2025-03-08 00:48:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:23,908 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-08 00:48:23,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-03-08 00:48:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:48:23,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:23,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:48:23,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1162521422, now seen corresponding path program 1 times [2025-03-08 00:48:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469534053] [2025-03-08 00:48:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:48:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:48:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469534053] [2025-03-08 00:48:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469534053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:24,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:24,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:48:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467669540] [2025-03-08 00:48:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:24,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:48:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:24,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:48:24,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:48:24,060 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:24,113 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2025-03-08 00:48:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:48:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:48:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:24,114 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:48:24,114 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:48:24,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:48:24,115 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:24,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:48:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:48:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:48:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:48:24,120 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-08 00:48:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:24,120 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:48:24,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:48:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:48:24,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:24,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:24,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:48:24,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 937111922, now seen corresponding path program 1 times [2025-03-08 00:48:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720492308] [2025-03-08 00:48:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:24,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:48:24,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:48:24,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:24,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720492308] [2025-03-08 00:48:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720492308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762217823] [2025-03-08 00:48:25,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:25,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:25,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:25,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:48:25,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:48:25,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:48:25,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:25,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:25,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:48:25,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:25,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:25,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:25,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:25,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:25,805 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 15 [2025-03-08 00:48:25,809 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-08 00:48:25,885 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 29 treesize of output 17 [2025-03-08 00:48:25,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-08 00:48:25,953 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 25 treesize of output 13 [2025-03-08 00:48:25,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 15 treesize of output 7 [2025-03-08 00:48:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:26,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:26,180 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 34 treesize of output 32 [2025-03-08 00:48:26,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-03-08 00:48:26,242 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 25 [2025-03-08 00:48:26,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2025-03-08 00:48:26,302 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 21 [2025-03-08 00:48:26,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-08 00:48:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762217823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:26,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2025-03-08 00:48:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076992085] [2025-03-08 00:48:26,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 00:48:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 00:48:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:48:26,342 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:26,584 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-08 00:48:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:48:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 00:48:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:26,584 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:48:26,584 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:48:26,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:48:26,585 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:26,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 62 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:48:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:48:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-08 00:48:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 00:48:26,590 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2025-03-08 00:48:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 00:48:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 00:48:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:48:26,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:26,590 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:26,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:26,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:26,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1014269741, now seen corresponding path program 2 times [2025-03-08 00:48:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619169883] [2025-03-08 00:48:26,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:26,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:48:26,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:48:26,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:48:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619169883] [2025-03-08 00:48:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619169883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456670218] [2025-03-08 00:48:26,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:26,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:26,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:48:26,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:48:26,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:48:26,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:26,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:26,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:48:26,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:48:26,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:48:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456670218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:27,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:27,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:48:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857667778] [2025-03-08 00:48:27,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:27,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:48:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:27,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:48:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:27,018 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:27,121 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2025-03-08 00:48:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:48:27,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 00:48:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:27,122 INFO L225 Difference]: With dead ends: 57 [2025-03-08 00:48:27,122 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:48:27,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:48:27,123 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:27,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:48:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-08 00:48:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 00:48:27,130 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2025-03-08 00:48:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:27,130 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 00:48:27,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 00:48:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:48:27,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:27,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:27,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:27,331 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,SelfDestructingSolverStorable3 [2025-03-08 00:48:27,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1683654286, now seen corresponding path program 3 times [2025-03-08 00:48:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82524646] [2025-03-08 00:48:27,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:27,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-08 00:48:27,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:48:27,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:48:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:48:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82524646] [2025-03-08 00:48:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82524646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425871360] [2025-03-08 00:48:27,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:27,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:27,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:27,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:27,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:48:27,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-08 00:48:27,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:48:27,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:48:27,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:48:27,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:48:27,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:48:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425871360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:27,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:48:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690891146] [2025-03-08 00:48:27,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:48:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:27,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:48:27,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:48:27,580 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:27,660 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-08 00:48:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:48:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:48:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:27,661 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:48:27,661 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:48:27,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:48:27,661 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:27,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:48:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 00:48:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-08 00:48:27,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2025-03-08 00:48:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-08 00:48:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-08 00:48:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:48:27,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:27,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:27,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:27,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2128050546, now seen corresponding path program 4 times [2025-03-08 00:48:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146683121] [2025-03-08 00:48:27,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:27,879 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:27,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:48:27,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:27,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146683121] [2025-03-08 00:48:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146683121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508282807] [2025-03-08 00:48:29,196 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:29,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:29,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:29,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:29,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:48:29,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:48:29,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:48:29,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:29,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:29,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-08 00:48:29,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:29,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:29,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:29,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:48:29,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:29,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:48:29,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:29,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:48:29,850 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 15 [2025-03-08 00:48:29,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:29,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 31 [2025-03-08 00:48:29,934 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 36 treesize of output 13 [2025-03-08 00:48:30,058 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 29 treesize of output 17 [2025-03-08 00:48:30,124 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 35 treesize of output 23 [2025-03-08 00:48:30,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:30,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2025-03-08 00:48:30,209 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 25 treesize of output 13 [2025-03-08 00:48:30,250 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 25 treesize of output 13 [2025-03-08 00:48:30,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:48:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:30,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:30,644 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 78 treesize of output 74 [2025-03-08 00:48:30,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:30,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 741 treesize of output 717 [2025-03-08 00:48:30,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-03-08 00:48:30,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1180 treesize of output 1132 [2025-03-08 00:48:31,026 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 54 treesize of output 50 [2025-03-08 00:48:31,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 880 treesize of output 832 [2025-03-08 00:48:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508282807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:31,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2025-03-08 00:48:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033511932] [2025-03-08 00:48:31,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 00:48:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 00:48:31,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2841, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 00:48:31,095 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 57 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:32,548 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-08 00:48:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 00:48:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:48:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:32,550 INFO L225 Difference]: With dead ends: 55 [2025-03-08 00:48:32,550 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:48:32,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1922 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=787, Invalid=5219, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 00:48:32,554 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:32,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:48:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:48:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2025-03-08 00:48:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-08 00:48:32,564 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 25 [2025-03-08 00:48:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:32,564 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-08 00:48:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-08 00:48:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:48:32,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,565 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:32,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:32,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1545089235, now seen corresponding path program 5 times [2025-03-08 00:48:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317551329] [2025-03-08 00:48:32,770 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:32,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-08 00:48:32,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:48:32,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:48:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:48:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317551329] [2025-03-08 00:48:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317551329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604512765] [2025-03-08 00:48:32,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:32,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:32,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:48:32,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-08 00:48:32,948 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:48:32,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:48:32,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:48:32,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:48:32,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:48:33,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604512765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:33,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:33,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:48:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693646071] [2025-03-08 00:48:33,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:33,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:48:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:33,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:48:33,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:48:33,039 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:33,166 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2025-03-08 00:48:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:48:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:48:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:33,167 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:48:33,167 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:48:33,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:48:33,168 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:33,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:48:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-08 00:48:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-08 00:48:33,179 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2025-03-08 00:48:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-08 00:48:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-08 00:48:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:48:33,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:33,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:33,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:48:33,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:33,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1548367374, now seen corresponding path program 6 times [2025-03-08 00:48:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:33,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877403279] [2025-03-08 00:48:33,381 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:33,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-08 00:48:33,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:33,411 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:48:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:48:33,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877403279] [2025-03-08 00:48:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877403279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704653707] [2025-03-08 00:48:33,495 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:48:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:33,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:48:33,547 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-08 00:48:33,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:48:33,573 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:48:33,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:33,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:48:33,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:48:33,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:48:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704653707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:33,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:33,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:48:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795404292] [2025-03-08 00:48:33,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:33,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:48:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:33,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:48:33,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:48:33,654 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:33,751 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-08 00:48:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:48:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:48:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:33,752 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:48:33,752 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:48:33,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:33,753 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:33,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:48:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 00:48:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-08 00:48:33,759 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 29 [2025-03-08 00:48:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:33,759 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-08 00:48:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-08 00:48:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:48:33,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:33,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:33,766 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-08 00:48:33,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:33,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 708967986, now seen corresponding path program 7 times [2025-03-08 00:48:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:33,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401321746] [2025-03-08 00:48:33,964 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:33,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:48:34,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:48:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401321746] [2025-03-08 00:48:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401321746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120117538] [2025-03-08 00:48:36,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:48:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:36,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:36,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:48:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:48:36,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:48:36,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:36,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:36,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-08 00:48:36,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:36,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:36,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:48:36,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:48:36,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:36,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:48:36,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:48:36,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:36,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:48:36,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:36,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:48:36,990 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 15 [2025-03-08 00:48:37,061 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 33 treesize of output 21 [2025-03-08 00:48:37,143 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 39 treesize of output 27 [2025-03-08 00:48:37,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:37,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 20 [2025-03-08 00:48:37,253 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 29 treesize of output 17 [2025-03-08 00:48:37,326 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 35 treesize of output 23 [2025-03-08 00:48:37,381 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 40 treesize of output 28 [2025-03-08 00:48:37,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:37,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2025-03-08 00:48:37,481 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 25 treesize of output 13 [2025-03-08 00:48:37,524 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 25 treesize of output 13 [2025-03-08 00:48:37,570 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 25 treesize of output 13 [2025-03-08 00:48:37,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:48:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:37,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:38,218 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 138 treesize of output 132 [2025-03-08 00:48:38,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:38,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31842 treesize of output 31202 [2025-03-08 00:48:38,506 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 118 treesize of output 112 [2025-03-08 00:48:38,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:38,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3063462 treesize of output 2981542 [2025-03-08 00:48:38,885 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 100 treesize of output 94 [2025-03-08 00:48:38,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:38,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 990518 treesize of output 949558 [2025-03-08 00:48:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120117538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:39,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 74 [2025-03-08 00:48:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344879479] [2025-03-08 00:48:39,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:39,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-08 00:48:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:39,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-08 00:48:39,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=4827, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:48:39,016 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 74 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:40,921 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2025-03-08 00:48:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 00:48:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 00:48:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:40,922 INFO L225 Difference]: With dead ends: 66 [2025-03-08 00:48:40,922 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 00:48:40,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3248 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=984, Invalid=8136, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 00:48:40,924 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:40,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:48:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 00:48:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2025-03-08 00:48:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-08 00:48:40,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 31 [2025-03-08 00:48:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:40,934 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-08 00:48:40,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-08 00:48:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:48:40,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:40,934 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:40,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:41,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 503202835, now seen corresponding path program 8 times [2025-03-08 00:48:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759989495] [2025-03-08 00:48:41,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:41,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:48:41,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:48:41,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:41,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:48:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759989495] [2025-03-08 00:48:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759989495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516462035] [2025-03-08 00:48:41,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:48:41,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:41,237 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-08 00:48:41,238 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-08 00:48:41,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:48:41,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:48:41,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:48:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:48:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:48:41,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:48:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516462035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:41,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:48:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311968797] [2025-03-08 00:48:41,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:48:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:48:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:41,441 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:41,602 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2025-03-08 00:48:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:48:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 00:48:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:41,603 INFO L225 Difference]: With dead ends: 91 [2025-03-08 00:48:41,603 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 00:48:41,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:48:41,604 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:41,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 00:48:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 00:48:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-03-08 00:48:41,613 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2025-03-08 00:48:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:41,613 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-08 00:48:41,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-03-08 00:48:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:48:41,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:41,614 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:41,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:48:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:48:41,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 475473458, now seen corresponding path program 9 times [2025-03-08 00:48:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840274673] [2025-03-08 00:48:41,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:41,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-08 00:48:41,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:48:41,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:48:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840274673] [2025-03-08 00:48:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840274673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561896647] [2025-03-08 00:48:41,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:48:41,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:41,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:41,937 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-08 00:48:41,939 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-08 00:48:42,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-08 00:48:42,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:48:42,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:48:42,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:42,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:48:42,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:48:42,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:48:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561896647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:42,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:48:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305112865] [2025-03-08 00:48:42,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:48:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:42,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:48:42,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:42,198 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:42,342 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-08 00:48:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:48:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 00:48:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:42,343 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:48:42,343 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:48:42,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:48:42,344 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:42,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:48:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 00:48:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-08 00:48:42,355 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 35 [2025-03-08 00:48:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:42,356 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-08 00:48:42,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-08 00:48:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:48:42,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:42,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:42,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:48:42,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:42,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:42,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1599831602, now seen corresponding path program 10 times [2025-03-08 00:48:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:42,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812457981] [2025-03-08 00:48:42,557 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:42,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:48:42,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:48:42,590 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:42,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812457981] [2025-03-08 00:48:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812457981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647760920] [2025-03-08 00:48:45,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:48:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:45,365 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-08 00:48:45,365 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-08 00:48:45,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:48:45,624 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:48:45,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:48:45,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-08 00:48:45,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:45,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:45,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:45,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:48:45,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:48:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:48:45,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:48:46,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:48:46,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:48:46,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:48:46,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:48:46,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:48:46,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:46,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:48:46,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:46,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:48:46,881 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 15 [2025-03-08 00:48:46,985 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 33 treesize of output 21 [2025-03-08 00:48:47,097 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 39 treesize of output 27 [2025-03-08 00:48:47,213 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 44 treesize of output 32 [2025-03-08 00:48:47,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:47,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 24 [2025-03-08 00:48:47,393 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 29 treesize of output 17 [2025-03-08 00:48:47,504 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 35 treesize of output 23 [2025-03-08 00:48:47,598 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 40 treesize of output 28 [2025-03-08 00:48:47,688 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 45 treesize of output 33 [2025-03-08 00:48:47,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:47,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 25 [2025-03-08 00:48:47,812 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 25 treesize of output 13 [2025-03-08 00:48:47,871 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 25 treesize of output 13 [2025-03-08 00:48:47,922 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 25 treesize of output 13 [2025-03-08 00:48:47,984 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 25 treesize of output 13 [2025-03-08 00:48:48,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:48:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:48,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:49,155 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 214 treesize of output 206 [2025-03-08 00:48:49,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:49,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5095931 treesize of output 5038587 [2025-03-08 00:48:49,881 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 187 treesize of output 179 [2025-03-08 00:48:50,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:50,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228297076726 treesize of output 224538980342 [2025-03-08 00:48:52,764 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 162 treesize of output 154 [2025-03-08 00:48:52,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:48:53,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 483450198 treesize of output 468770134 [2025-03-08 00:48:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647760920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:53,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 94 [2025-03-08 00:48:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861843029] [2025-03-08 00:48:53,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-03-08 00:48:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-03-08 00:48:53,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=8045, Unknown=0, NotChecked=0, Total=8742 [2025-03-08 00:48:53,687 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 94 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:59,368 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-03-08 00:48:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-08 00:48:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 00:48:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:59,370 INFO L225 Difference]: With dead ends: 83 [2025-03-08 00:48:59,370 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 00:48:59,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5526 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1560, Invalid=15732, Unknown=0, NotChecked=0, Total=17292 [2025-03-08 00:48:59,373 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:59,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 174 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 00:48:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 00:48:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2025-03-08 00:48:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-03-08 00:48:59,391 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 37 [2025-03-08 00:48:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:59,391 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-03-08 00:48:59,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:48:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-03-08 00:48:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:48:59,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:59,392 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:59,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:48:59,592 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,SelfDestructingSolverStorable11 [2025-03-08 00:48:59,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1944796141, now seen corresponding path program 11 times [2025-03-08 00:48:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784958330] [2025-03-08 00:48:59,593 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:59,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-08 00:48:59,630 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:48:59,630 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:48:59,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:48:59,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784958330] [2025-03-08 00:48:59,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784958330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654392672] [2025-03-08 00:48:59,740 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:48:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:59,742 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-08 00:48:59,744 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-08 00:48:59,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-08 00:49:00,207 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:49:00,207 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:49:00,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:00,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:00,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:49:00,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:49:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654392672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:00,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-08 00:49:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223648327] [2025-03-08 00:49:00,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:49:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:49:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:49:00,345 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:00,508 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2025-03-08 00:49:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 00:49:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:00,508 INFO L225 Difference]: With dead ends: 129 [2025-03-08 00:49:00,508 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:49:00,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:49:00,509 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:00,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:49:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2025-03-08 00:49:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-08 00:49:00,523 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 38 [2025-03-08 00:49:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-08 00:49:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-08 00:49:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:49:00,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:00,523 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:00,531 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-08 00:49:00,728 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,SelfDestructingSolverStorable12 [2025-03-08 00:49:00,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 630992562, now seen corresponding path program 12 times [2025-03-08 00:49:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596301085] [2025-03-08 00:49:00,728 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:00,738 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-03-08 00:49:00,757 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:00,757 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:49:00,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:49:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596301085] [2025-03-08 00:49:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596301085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665607110] [2025-03-08 00:49:00,884 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:00,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:00,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:49:00,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-03-08 00:49:01,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:49:01,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:49:01,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:01,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:01,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:49:01,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:49:01,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665607110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:01,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:01,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-08 00:49:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036873772] [2025-03-08 00:49:01,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:49:01,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:01,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:49:01,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:49:01,272 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:01,426 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-08 00:49:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:49:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:49:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:01,426 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:49:01,426 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:49:01,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:49:01,427 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:01,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:49:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 00:49:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-08 00:49:01,440 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 41 [2025-03-08 00:49:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:01,440 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-08 00:49:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-08 00:49:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:49:01,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:01,441 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:01,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:49:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:49:01,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:01,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1209488654, now seen corresponding path program 13 times [2025-03-08 00:49:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275188585] [2025-03-08 00:49:01,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:01,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:49:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:49:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275188585] [2025-03-08 00:49:05,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275188585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334674849] [2025-03-08 00:49:05,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:05,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:05,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:49:05,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:49:06,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:49:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:49:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:06,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-03-08 00:49:06,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:06,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:49:06,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:49:06,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:49:06,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:49:06,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:49:06,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-03-08 00:49:06,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:49:06,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:49:06,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:49:06,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:49:06,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-03-08 00:49:07,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:49:07,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:49:07,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:49:07,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:07,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:49:07,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:07,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-08 00:49:07,775 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 15 [2025-03-08 00:49:07,934 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 33 treesize of output 21 [2025-03-08 00:49:08,074 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 39 treesize of output 27 [2025-03-08 00:49:08,218 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 44 treesize of output 32 [2025-03-08 00:49:08,337 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 49 treesize of output 37 [2025-03-08 00:49:08,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:08,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 28 [2025-03-08 00:49:08,522 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 29 treesize of output 17 [2025-03-08 00:49:08,617 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 35 treesize of output 23 [2025-03-08 00:49:08,731 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 40 treesize of output 28 [2025-03-08 00:49:08,837 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 45 treesize of output 33 [2025-03-08 00:49:08,926 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 50 treesize of output 38 [2025-03-08 00:49:08,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:08,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 29 [2025-03-08 00:49:09,069 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 25 treesize of output 13 [2025-03-08 00:49:09,133 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 25 treesize of output 13 [2025-03-08 00:49:09,202 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 25 treesize of output 13 [2025-03-08 00:49:09,265 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 25 treesize of output 13 [2025-03-08 00:49:09,345 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 25 treesize of output 13 [2025-03-08 00:49:09,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:49:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:09,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:11,105 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 306 treesize of output 296 [2025-03-08 00:49:11,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3035699152 treesize of output 3016824784 [2025-03-08 00:49:12,280 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 272 treesize of output 262 [2025-03-08 00:49:21,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:21,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input -1197898793377331342 treesize of output -1522157966548007054