./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:39:31,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:39:31,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:39:31,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:39:31,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:39:31,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:39:31,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:39:31,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:39:31,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:39:31,560 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:39:31,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:39:31,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:39:31,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:39:31,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:39:31,560 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:39:31,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:39:31,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:39:31,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:39:31,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:31,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:31,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:31,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:39:31,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:39:31,563 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-jdk21/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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2025-01-09 03:39:31,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:39:31,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:39:31,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:39:31,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:39:31,780 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:39:31,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2025-01-09 03:39:32,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ae5c552d/f4b78ddd48304c7eb79f40173d773f68/FLAGcb3fe27a9 [2025-01-09 03:39:33,133 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:39:33,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2025-01-09 03:39:33,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ae5c552d/f4b78ddd48304c7eb79f40173d773f68/FLAGcb3fe27a9 [2025-01-09 03:39:33,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ae5c552d/f4b78ddd48304c7eb79f40173d773f68 [2025-01-09 03:39:33,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:39:33,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:39:33,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:33,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:39:33,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:39:33,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7f80c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33, skipping insertion in model container [2025-01-09 03:39:33,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:39:33,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c[485,498] [2025-01-09 03:39:33,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:33,336 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:39:33,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c[485,498] [2025-01-09 03:39:33,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:33,374 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:39:33,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33 WrapperNode [2025-01-09 03:39:33,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:33,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:33,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:39:33,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:39:33,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,408 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-01-09 03:39:33,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:33,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:39:33,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:39:33,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:39:33,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,431 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 7, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 3, 1]. [2025-01-09 03:39:33,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:39:33,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:39:33,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:39:33,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:39:33,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (1/1) ... [2025-01-09 03:39:33,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:33,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:39:33,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:39:33,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:39:33,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 03:39:33,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:39:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:39:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:39:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 03:39:33,571 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:39:33,573 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:39:33,735 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-01-09 03:39:33,735 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:39:33,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:39:33,742 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:39:33,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:33 BoogieIcfgContainer [2025-01-09 03:39:33,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:39:33,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:39:33,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:39:33,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:39:33,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:39:33" (1/3) ... [2025-01-09 03:39:33,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530df3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:33, skipping insertion in model container [2025-01-09 03:39:33,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:33" (2/3) ... [2025-01-09 03:39:33,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530df3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:33, skipping insertion in model container [2025-01-09 03:39:33,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:33" (3/3) ... [2025-01-09 03:39:33,749 INFO L128 eAbstractionObserver]: Analyzing ICFG duplets.c [2025-01-09 03:39:33,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:39:33,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG duplets.c that has 3 procedures, 39 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:39:33,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:39:33,800 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;@69e73581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:39:33,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:39:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:39:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 03:39:33,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:33,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:33,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1896311812, now seen corresponding path program 1 times [2025-01-09 03:39:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430390428] [2025-01-09 03:39:33,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:39:33,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:39:33,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:33,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:39:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430390428] [2025-01-09 03:39:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430390428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880495797] [2025-01-09 03:39:33,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:33,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:33,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:33,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:39:34,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:39:34,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:39:34,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:34,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:34,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:39:34,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:39:34,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:39:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880495797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:39:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 03:39:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178447967] [2025-01-09 03:39:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:34,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:39:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:34,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:39:34,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:39:34,073 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 03:39:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:34,085 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2025-01-09 03:39:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:39:34,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-01-09 03:39:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:34,090 INFO L225 Difference]: With dead ends: 75 [2025-01-09 03:39:34,090 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 03:39:34,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 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-01-09 03:39:34,094 INFO L435 NwaCegarLoop]: 50 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, 50 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-01-09 03:39:34,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 03:39:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 03:39:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:39:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-01-09 03:39:34,116 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 32 [2025-01-09 03:39:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-01-09 03:39:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 03:39:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-01-09 03:39:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 03:39:34,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:34,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:34,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:39:34,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:39:34,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1991880444, now seen corresponding path program 1 times [2025-01-09 03:39:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279790156] [2025-01-09 03:39:34,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:39:34,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:39:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279790156] [2025-01-09 03:39:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279790156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599420557] [2025-01-09 03:39:34,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:34,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:34,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:39:34,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:39:34,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:39:34,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:34,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:34,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:39:34,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:34,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599420557] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:34,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-01-09 03:39:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951164329] [2025-01-09 03:39:34,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:39:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:34,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:39:34,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:39:34,891 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 03:39:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:35,004 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2025-01-09 03:39:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:39:35,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2025-01-09 03:39:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:35,007 INFO L225 Difference]: With dead ends: 61 [2025-01-09 03:39:35,007 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 03:39:35,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:39:35,007 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:35,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 03:39:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-01-09 03:39:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:39:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-01-09 03:39:35,020 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 32 [2025-01-09 03:39:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:35,020 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-01-09 03:39:35,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 03:39:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-01-09 03:39:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 03:39:35,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:35,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:35,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:39:35,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:35,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:35,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1159407367, now seen corresponding path program 1 times [2025-01-09 03:39:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881022393] [2025-01-09 03:39:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:35,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 03:39:35,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 03:39:35,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:35,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:35,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881022393] [2025-01-09 03:39:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881022393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:39:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097941301] [2025-01-09 03:39:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:39:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:35,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:39:35,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:35,636 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 03:39:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:35,831 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2025-01-09 03:39:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:39:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-01-09 03:39:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:35,832 INFO L225 Difference]: With dead ends: 65 [2025-01-09 03:39:35,832 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 03:39:35,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:39:35,832 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:35,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 276 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 03:39:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2025-01-09 03:39:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:39:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2025-01-09 03:39:35,837 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2025-01-09 03:39:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-01-09 03:39:35,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 03:39:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2025-01-09 03:39:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 03:39:35,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:35,838 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:35,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:39:35,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:35,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash -929926010, now seen corresponding path program 1 times [2025-01-09 03:39:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433155897] [2025-01-09 03:39:35,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 03:39:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 03:39:35,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433155897] [2025-01-09 03:39:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433155897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:39:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804730842] [2025-01-09 03:39:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:39:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:35,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:39:35,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:39:35,901 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:35,931 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-01-09 03:39:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:39:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-01-09 03:39:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:35,932 INFO L225 Difference]: With dead ends: 55 [2025-01-09 03:39:35,932 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 03:39:35,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:39:35,933 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:35,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 03:39:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2025-01-09 03:39:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:39:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-01-09 03:39:35,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 34 [2025-01-09 03:39:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:35,939 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-01-09 03:39:35,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-01-09 03:39:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 03:39:35,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:35,939 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:39:35,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:35,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1710599390, now seen corresponding path program 1 times [2025-01-09 03:39:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:35,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946266041] [2025-01-09 03:39:35,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 03:39:35,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 03:39:35,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:35,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946266041] [2025-01-09 03:39:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946266041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852731266] [2025-01-09 03:39:36,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:36,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:36,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:39:36,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 03:39:36,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 03:39:36,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:36,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:36,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:39:36,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:36,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852731266] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:36,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:36,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-01-09 03:39:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108992588] [2025-01-09 03:39:36,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:39:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:36,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:39:36,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:39:36,168 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:36,223 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-01-09 03:39:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:39:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-01-09 03:39:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:36,225 INFO L225 Difference]: With dead ends: 63 [2025-01-09 03:39:36,225 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 03:39:36,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:39:36,226 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:36,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 156 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 03:39:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 03:39:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:39:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-01-09 03:39:36,238 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 36 [2025-01-09 03:39:36,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:36,238 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-01-09 03:39:36,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-01-09 03:39:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 03:39:36,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:36,239 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:36,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:39:36,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:36,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash -690792019, now seen corresponding path program 2 times [2025-01-09 03:39:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564011599] [2025-01-09 03:39:36,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:39:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:36,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 03:39:36,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:39:36,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:39:36,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:39:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564011599] [2025-01-09 03:39:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564011599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720354177] [2025-01-09 03:39:37,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:39:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:37,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:37,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:39:37,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 03:39:37,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:39:37,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:39:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:37,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 03:39:37,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:37,852 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 03:39:37,853 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 1 case distinctions, treesize of input 38 treesize of output 19 [2025-01-09 03:39:38,073 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-09 03:39:38,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 46 [2025-01-09 03:39:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:38,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:38,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 03:39:38,514 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 503 treesize of output 435 [2025-01-09 03:39:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:39:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720354177] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:41,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2025-01-09 03:39:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952115714] [2025-01-09 03:39:41,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:41,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 03:39:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:41,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 03:39:41,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 03:39:41,313 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 03:39:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:42,470 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2025-01-09 03:39:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 03:39:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2025-01-09 03:39:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:42,473 INFO L225 Difference]: With dead ends: 91 [2025-01-09 03:39:42,473 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 03:39:42,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 03:39:42,475 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 99 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:42,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 536 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:39:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 03:39:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-01-09 03:39:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:39:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-01-09 03:39:42,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 38 [2025-01-09 03:39:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:42,485 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-01-09 03:39:42,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 03:39:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-01-09 03:39:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 03:39:42,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:42,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:42,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:39:42,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 03:39:42,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:42,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:42,691 INFO L85 PathProgramCache]: Analyzing trace with hash 871232029, now seen corresponding path program 1 times [2025-01-09 03:39:42,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331156133] [2025-01-09 03:39:42,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:42,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 03:39:42,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 03:39:42,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:42,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:42,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:42,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331156133] [2025-01-09 03:39:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331156133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:42,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:39:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892432640] [2025-01-09 03:39:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:42,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:39:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:39:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:42,903 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 03:39:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:43,068 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-01-09 03:39:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:39:43,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2025-01-09 03:39:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:43,070 INFO L225 Difference]: With dead ends: 79 [2025-01-09 03:39:43,070 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 03:39:43,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:39:43,071 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:43,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 03:39:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-01-09 03:39:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:39:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-01-09 03:39:43,082 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 41 [2025-01-09 03:39:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:43,082 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-01-09 03:39:43,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 03:39:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-01-09 03:39:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 03:39:43,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:43,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:43,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:39:43,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash -778349229, now seen corresponding path program 3 times [2025-01-09 03:39:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495442645] [2025-01-09 03:39:43,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:39:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:43,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-01-09 03:39:43,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 03:39:43,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 03:39:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:39:43,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495442645] [2025-01-09 03:39:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495442645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:39:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962929899] [2025-01-09 03:39:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:39:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:43,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:39:43,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:39:43,135 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:43,155 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2025-01-09 03:39:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:39:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-01-09 03:39:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:43,158 INFO L225 Difference]: With dead ends: 91 [2025-01-09 03:39:43,158 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 03:39:43,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:39:43,159 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:43,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 03:39:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-01-09 03:39:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 46 states have internal predecessors, (52), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:39:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-01-09 03:39:43,172 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 42 [2025-01-09 03:39:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-01-09 03:39:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-01-09 03:39:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 03:39:43,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:43,173 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:43,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:39:43,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -226448786, now seen corresponding path program 4 times [2025-01-09 03:39:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135647106] [2025-01-09 03:39:43,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:39:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:43,181 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-09 03:39:43,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 03:39:43,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:39:43,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:39:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135647106] [2025-01-09 03:39:44,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135647106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667263896] [2025-01-09 03:39:44,495 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:39:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:44,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:44,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:39:44,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-09 03:39:44,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 03:39:44,572 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:39:44,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:44,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 03:39:44,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:44,582 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 7 treesize of output 6 [2025-01-09 03:39:44,913 INFO L349 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2025-01-09 03:39:44,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2025-01-09 03:39:45,596 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 67 treesize of output 49 [2025-01-09 03:39:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 03:39:45,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667263896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:46,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:39:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2025-01-09 03:39:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61310454] [2025-01-09 03:39:46,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:46,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 03:39:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:46,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 03:39:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 03:39:46,300 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 33 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 03:39:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:48,523 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2025-01-09 03:39:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 03:39:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2025-01-09 03:39:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:48,527 INFO L225 Difference]: With dead ends: 107 [2025-01-09 03:39:48,528 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 03:39:48,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=475, Invalid=3431, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 03:39:48,530 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:48,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 450 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 03:39:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 03:39:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2025-01-09 03:39:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:39:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-01-09 03:39:48,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 44 [2025-01-09 03:39:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:48,548 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-01-09 03:39:48,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 03:39:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-01-09 03:39:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 03:39:48,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:48,551 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:48,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:39:48,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:48,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 30825916, now seen corresponding path program 1 times [2025-01-09 03:39:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646255527] [2025-01-09 03:39:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:48,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 03:39:48,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 03:39:48,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:48,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:39:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646255527] [2025-01-09 03:39:48,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646255527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641818482] [2025-01-09 03:39:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:48,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:48,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:39:48,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 03:39:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 03:39:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:49,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 03:39:49,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:49,104 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-01-09 03:39:49,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 03:39:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:49,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:49,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-09 03:39:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:39:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641818482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:49,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2025-01-09 03:39:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452387224] [2025-01-09 03:39:49,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:49,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 03:39:49,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 03:39:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:39:49,303 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:39:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:49,554 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2025-01-09 03:39:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:39:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 47 [2025-01-09 03:39:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:49,556 INFO L225 Difference]: With dead ends: 93 [2025-01-09 03:39:49,556 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 03:39:49,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:39:49,556 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:49,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:39:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 03:39:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2025-01-09 03:39:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:39:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-01-09 03:39:49,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 47 [2025-01-09 03:39:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:49,577 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-01-09 03:39:49,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:39:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-01-09 03:39:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 03:39:49,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:49,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:49,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:39:49,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:39:49,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:49,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:49,779 INFO L85 PathProgramCache]: Analyzing trace with hash 32672958, now seen corresponding path program 1 times [2025-01-09 03:39:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:49,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494313704] [2025-01-09 03:39:49,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:49,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 03:39:49,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 03:39:49,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:49,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:39:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494313704] [2025-01-09 03:39:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494313704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21683191] [2025-01-09 03:39:49,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:49,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:49,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:39:49,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 03:39:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 03:39:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:49,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 03:39:49,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:50,063 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-01-09 03:39:50,109 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-01-09 03:39:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:39:50,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:39:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21683191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:39:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2025-01-09 03:39:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313339499] [2025-01-09 03:39:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:39:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:39:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:50,112 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:39:54,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 03:39:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:54,208 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2025-01-09 03:39:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:39:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-01-09 03:39:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:54,210 INFO L225 Difference]: With dead ends: 109 [2025-01-09 03:39:54,210 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 03:39:54,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:39:54,210 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:54,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 196 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 03:39:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 03:39:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-01-09 03:39:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 71 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:39:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2025-01-09 03:39:54,238 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 47 [2025-01-09 03:39:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:54,239 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2025-01-09 03:39:54,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:39:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2025-01-09 03:39:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 03:39:54,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:54,239 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:39:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:54,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 215100646, now seen corresponding path program 1 times [2025-01-09 03:39:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640212942] [2025-01-09 03:39:54,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:54,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 03:39:54,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 03:39:54,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:39:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640212942] [2025-01-09 03:39:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640212942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:54,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:39:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030009820] [2025-01-09 03:39:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:54,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:39:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:54,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:39:54,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:39:54,717 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:39:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:54,828 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-01-09 03:39:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:39:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2025-01-09 03:39:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:54,829 INFO L225 Difference]: With dead ends: 115 [2025-01-09 03:39:54,829 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 03:39:54,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:54,830 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:54,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 247 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 03:39:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2025-01-09 03:39:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 80 states have internal predecessors, (91), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:39:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-01-09 03:39:54,841 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 48 [2025-01-09 03:39:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:54,842 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-01-09 03:39:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:39:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-01-09 03:39:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 03:39:54,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:54,843 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:39:54,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:54,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 216947688, now seen corresponding path program 1 times [2025-01-09 03:39:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827438023] [2025-01-09 03:39:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:54,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 03:39:54,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 03:39:54,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:39:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827438023] [2025-01-09 03:39:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827438023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:39:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977292028] [2025-01-09 03:39:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:39:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:39:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:39:54,929 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:39:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:54,976 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2025-01-09 03:39:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:39:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-01-09 03:39:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:54,978 INFO L225 Difference]: With dead ends: 119 [2025-01-09 03:39:54,978 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 03:39:54,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:39:54,978 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:54,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 03:39:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2025-01-09 03:39:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 80 states have internal predecessors, (90), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:39:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-01-09 03:39:54,989 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 48 [2025-01-09 03:39:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:54,989 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-01-09 03:39:54,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:39:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-01-09 03:39:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 03:39:54,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:54,990 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:39:54,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2101084060, now seen corresponding path program 5 times [2025-01-09 03:39:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429575445] [2025-01-09 03:39:54,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:39:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:54,996 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 7 equivalence classes. [2025-01-09 03:39:55,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 48 statements. [2025-01-09 03:39:55,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 03:39:55,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:39:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429575445] [2025-01-09 03:39:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429575445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495465106] [2025-01-09 03:39:55,055 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:39:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:55,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:55,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:39:55,110 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 7 equivalence classes. [2025-01-09 03:39:55,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 48 statements. [2025-01-09 03:39:55,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-09 03:39:55,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:55,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:39:55,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:39:55,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:39:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495465106] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:55,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-01-09 03:39:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221320882] [2025-01-09 03:39:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:39:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:39:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:39:55,164 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:55,218 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2025-01-09 03:39:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-01-09 03:39:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:55,219 INFO L225 Difference]: With dead ends: 128 [2025-01-09 03:39:55,220 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 03:39:55,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:55,220 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:55,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 156 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 03:39:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 03:39:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.2) internal successors, (96), 84 states have internal predecessors, (96), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:39:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2025-01-09 03:39:55,232 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 48 [2025-01-09 03:39:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:55,232 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-01-09 03:39:55,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 03:39:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2025-01-09 03:39:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 03:39:55,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:55,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:55,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:39:55,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:55,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 30763025, now seen corresponding path program 1 times [2025-01-09 03:39:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314855527] [2025-01-09 03:39:55,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 03:39:55,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 03:39:55,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:55,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:39:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314855527] [2025-01-09 03:39:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314855527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:39:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872953313] [2025-01-09 03:39:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:39:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:55,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:39:55,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:39:55,593 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:39:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:55,683 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2025-01-09 03:39:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:55,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2025-01-09 03:39:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:55,685 INFO L225 Difference]: With dead ends: 118 [2025-01-09 03:39:55,685 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 03:39:55,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:55,686 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:55,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 217 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 03:39:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-01-09 03:39:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 88 states have internal predecessors, (100), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 03:39:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-01-09 03:39:55,702 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 54 [2025-01-09 03:39:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:55,702 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-01-09 03:39:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:39:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-01-09 03:39:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 03:39:55,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:55,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:39:55,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -324898967, now seen corresponding path program 1 times [2025-01-09 03:39:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682950834] [2025-01-09 03:39:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 03:39:55,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 03:39:55,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:55,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:39:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682950834] [2025-01-09 03:39:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682950834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886151637] [2025-01-09 03:39:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:55,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:55,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:39:55,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 03:39:55,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 03:39:55,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:55,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:55,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 03:39:55,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:55,937 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-01-09 03:39:55,988 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-01-09 03:39:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:39:55,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-09 03:39:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:39:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886151637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:56,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:56,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2025-01-09 03:39:56,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201351984] [2025-01-09 03:39:56,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:39:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:56,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:39:56,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:39:56,090 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:40:00,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 03:40:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:00,279 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2025-01-09 03:40:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:40:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 54 [2025-01-09 03:40:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:00,280 INFO L225 Difference]: With dead ends: 128 [2025-01-09 03:40:00,280 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 03:40:00,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:40:00,281 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:00,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 03:40:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 03:40:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-01-09 03:40:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 87 states have internal predecessors, (99), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:40:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2025-01-09 03:40:00,293 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 54 [2025-01-09 03:40:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2025-01-09 03:40:00,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:40:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2025-01-09 03:40:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 03:40:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:00,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:40:00,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 03:40:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:00,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash -142197622, now seen corresponding path program 6 times [2025-01-09 03:40:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649663848] [2025-01-09 03:40:00,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:40:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:00,505 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 9 equivalence classes. [2025-01-09 03:40:00,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 03:40:00,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-09 03:40:00,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 9 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:40:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649663848] [2025-01-09 03:40:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649663848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:04,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640130128] [2025-01-09 03:40:04,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:40:04,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:04,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:04,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:04,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:40:04,481 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 9 equivalence classes. [2025-01-09 03:40:04,517 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 03:40:04,518 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-09 03:40:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:04,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 03:40:04,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:04,530 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 7 treesize of output 6 [2025-01-09 03:40:04,936 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 40 [2025-01-09 03:40:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 17 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:40:07,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:40:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640130128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:21,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:40:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 43 [2025-01-09 03:40:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856600908] [2025-01-09 03:40:21,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:40:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 03:40:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:21,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 03:40:21,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=3297, Unknown=2, NotChecked=0, Total=3660 [2025-01-09 03:40:21,965 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:40:28,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 03:40:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:29,780 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2025-01-09 03:40:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 03:40:29,780 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2025-01-09 03:40:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:29,781 INFO L225 Difference]: With dead ends: 151 [2025-01-09 03:40:29,781 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 03:40:29,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=718, Invalid=5132, Unknown=2, NotChecked=0, Total=5852 [2025-01-09 03:40:29,783 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:29,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 482 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 800 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 03:40:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 03:40:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2025-01-09 03:40:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:40:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2025-01-09 03:40:29,796 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2025-01-09 03:40:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:29,797 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2025-01-09 03:40:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:40:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2025-01-09 03:40:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:40:29,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:29,798 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:40:29,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 03:40:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:40:29,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -562880518, now seen corresponding path program 1 times [2025-01-09 03:40:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539024497] [2025-01-09 03:40:30,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:30,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:40:30,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:40:30,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:30,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:40:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539024497] [2025-01-09 03:40:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539024497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:40:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102792516] [2025-01-09 03:40:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:40:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:30,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:40:30,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:40:30,574 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:40:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:30,823 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-01-09 03:40:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:40:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2025-01-09 03:40:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:30,826 INFO L225 Difference]: With dead ends: 89 [2025-01-09 03:40:30,826 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 03:40:30,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:40:30,827 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:30,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 177 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:40:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 03:40:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 03:40:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:40:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-01-09 03:40:30,835 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 60 [2025-01-09 03:40:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:30,835 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-01-09 03:40:30,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:40:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-01-09 03:40:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:40:30,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:30,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:40:30,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:40:30,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:30,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 150148818, now seen corresponding path program 1 times [2025-01-09 03:40:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003374619] [2025-01-09 03:40:30,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:30,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:40:30,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:40:30,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:30,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:40:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003374619] [2025-01-09 03:40:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003374619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:40:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712080269] [2025-01-09 03:40:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:40:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:30,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:40:30,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:40:30,994 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:40:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:31,082 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-01-09 03:40:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:40:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2025-01-09 03:40:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:31,083 INFO L225 Difference]: With dead ends: 63 [2025-01-09 03:40:31,083 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 03:40:31,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:40:31,084 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:31,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 219 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 03:40:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 03:40:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:40:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-01-09 03:40:31,091 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 60 [2025-01-09 03:40:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-01-09 03:40:31,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:40:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-01-09 03:40:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:40:31,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:31,092 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:40:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:40:31,092 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1180108293, now seen corresponding path program 1 times [2025-01-09 03:40:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985952220] [2025-01-09 03:40:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:31,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:40:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:40:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 03:40:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985952220] [2025-01-09 03:40:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985952220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101950019] [2025-01-09 03:40:31,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:31,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:31,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:31,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:40:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:40:31,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:40:31,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:31,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:31,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 03:40:31,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:31,504 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 7 treesize of output 6 [2025-01-09 03:40:31,779 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2025-01-09 03:40:31,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2025-01-09 03:40:36,438 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-01-09 03:40:36,445 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-01-09 03:41:00,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 03:41:00,389 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 149 treesize of output 125 [2025-01-09 03:41:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 24 refuted. 4 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:41:00,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:41:00,659 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 84 treesize of output 80 [2025-01-09 03:41:00,662 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 130 [2025-01-09 03:41:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:41:03,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101950019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:41:03,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:41:03,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 14] total 41 [2025-01-09 03:41:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840038510] [2025-01-09 03:41:03,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:41:03,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 03:41:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:03,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 03:41:03,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1444, Unknown=4, NotChecked=0, Total=1640 [2025-01-09 03:41:03,629 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 36 states have internal predecessors, (82), 9 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22)