./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr5.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/array-tiling/mbpr5.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 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:16:41,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:16:41,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:16:41,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:16:41,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:16:41,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:16:41,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:16:41,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:16:41,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:16:41,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:16:41,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:16:41,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:16:41,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:16:41,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:16:41,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:41,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:41,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:16:41,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:16:41,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:16:41,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:16:41,243 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 -> 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b [2025-01-08 22:16:41,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:16:41,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:16:41,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:16:41,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:16:41,453 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:16:41,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr5.c [2025-01-08 22:16:42,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5dfa1169/a3f9345513d14024a03c21811c045286/FLAGb4f80046b [2025-01-08 22:16:42,843 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:16:42,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2025-01-08 22:16:42,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5dfa1169/a3f9345513d14024a03c21811c045286/FLAGb4f80046b [2025-01-08 22:16:43,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5dfa1169/a3f9345513d14024a03c21811c045286 [2025-01-08 22:16:43,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:16:43,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:16:43,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:16:43,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:16:43,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:16:43,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c1ffcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43, skipping insertion in model container [2025-01-08 22:16:43,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:16:43,298 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/array-tiling/mbpr5.c[396,409] [2025-01-08 22:16:43,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:16:43,343 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:16:43,351 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/array-tiling/mbpr5.c[396,409] [2025-01-08 22:16:43,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:16:43,391 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:16:43,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43 WrapperNode [2025-01-08 22:16:43,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:16:43,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:16:43,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:16:43,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:16:43,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,427 INFO L138 Inliner]: procedures = 15, calls = 72, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2025-01-08 22:16:43,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:16:43,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:16:43,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:16:43,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:16:43,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,457 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 52, 8]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8]. The 30 writes are split as follows [0, 30, 0]. [2025-01-08 22:16:43,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:16:43,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:16:43,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:16:43,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:16:43,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (1/1) ... [2025-01-08 22:16:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:43,505 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-08 22:16:43,513 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-08 22:16:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:16:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:16:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:16:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:16:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:16:43,587 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:16:43,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:16:43,785 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:16:43,785 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:16:43,791 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:16:43,791 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:16:43,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:16:43 BoogieIcfgContainer [2025-01-08 22:16:43,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:16:43,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:16:43,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:16:43,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:16:43,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:16:43" (1/3) ... [2025-01-08 22:16:43,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:16:43, skipping insertion in model container [2025-01-08 22:16:43,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:43" (2/3) ... [2025-01-08 22:16:43,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:16:43, skipping insertion in model container [2025-01-08 22:16:43,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:16:43" (3/3) ... [2025-01-08 22:16:43,799 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2025-01-08 22:16:43,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:16:43,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr5.c that has 1 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-08 22:16:43,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:16:43,863 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;@38bd4871, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:16:43,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:16:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:16:43,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:43,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:43,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 440794832, now seen corresponding path program 1 times [2025-01-08 22:16:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458070467] [2025-01-08 22:16:43,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:16:43,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:16:43,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458070467] [2025-01-08 22:16:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458070467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:16:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420091507] [2025-01-08 22:16:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:16:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:44,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:16:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:16:44,027 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:44,038 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-01-08 22:16:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:16:44,040 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:16:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:44,046 INFO L225 Difference]: With dead ends: 59 [2025-01-08 22:16:44,046 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:16:44,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:16:44,051 INFO L435 NwaCegarLoop]: 45 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, 45 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-08 22:16:44,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:16:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-08 22:16:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-01-08 22:16:44,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2025-01-08 22:16:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:44,075 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-01-08 22:16:44,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-01-08 22:16:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:16:44,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:44,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:44,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:16:44,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:44,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 698960270, now seen corresponding path program 1 times [2025-01-08 22:16:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698487456] [2025-01-08 22:16:44,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:44,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:16:44,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:16:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:44,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698487456] [2025-01-08 22:16:44,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698487456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:44,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:44,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:16:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038074848] [2025-01-08 22:16:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:44,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:16:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:44,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:16:44,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:16:44,268 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:44,290 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-01-08 22:16:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:16:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:16:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:44,291 INFO L225 Difference]: With dead ends: 32 [2025-01-08 22:16:44,292 INFO L226 Difference]: Without dead ends: 30 [2025-01-08 22:16:44,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 22:16:44,293 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:44,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-08 22:16:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-08 22:16:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-01-08 22:16:44,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 16 [2025-01-08 22:16:44,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:44,299 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-01-08 22:16:44,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-01-08 22:16:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:16:44,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:44,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:44,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:16:44,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:44,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 699019852, now seen corresponding path program 1 times [2025-01-08 22:16:44,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:44,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648480368] [2025-01-08 22:16:44,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:44,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:16:44,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:16:44,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:44,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648480368] [2025-01-08 22:16:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648480368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:16:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662822352] [2025-01-08 22:16:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:16:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:16:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:44,513 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:44,610 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2025-01-08 22:16:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:16:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:16:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:44,611 INFO L225 Difference]: With dead ends: 66 [2025-01-08 22:16:44,611 INFO L226 Difference]: Without dead ends: 45 [2025-01-08 22:16:44,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:44,612 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:44,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 18 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:16:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-08 22:16:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2025-01-08 22:16:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-01-08 22:16:44,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 16 [2025-01-08 22:16:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-01-08 22:16:44,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-01-08 22:16:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:16:44,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:44,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:44,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:16:44,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -868656171, now seen corresponding path program 1 times [2025-01-08 22:16:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296743630] [2025-01-08 22:16:44,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:44,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:16:44,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:16:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:44,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:44,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296743630] [2025-01-08 22:16:44,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296743630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:44,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:16:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64317759] [2025-01-08 22:16:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:16:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:44,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:16:44,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:16:44,730 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:44,746 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2025-01-08 22:16:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:16:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-08 22:16:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:44,747 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:16:44,747 INFO L226 Difference]: Without dead ends: 35 [2025-01-08 22:16:44,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:16:44,747 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:44,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-08 22:16:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-08 22:16:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-01-08 22:16:44,751 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 31 [2025-01-08 22:16:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:44,752 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-01-08 22:16:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-01-08 22:16:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:16:44,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:44,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:44,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:16:44,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1126821609, now seen corresponding path program 1 times [2025-01-08 22:16:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101212251] [2025-01-08 22:16:44,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:16:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:16:44,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:44,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101212251] [2025-01-08 22:16:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101212251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:16:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582915357] [2025-01-08 22:16:44,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:44,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:16:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:16:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:16:44,902 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:44,923 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2025-01-08 22:16:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:16:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-08 22:16:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:44,924 INFO L225 Difference]: With dead ends: 47 [2025-01-08 22:16:44,924 INFO L226 Difference]: Without dead ends: 35 [2025-01-08 22:16:44,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:16:44,925 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:44,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-08 22:16:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-08 22:16:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-01-08 22:16:44,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 31 [2025-01-08 22:16:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-01-08 22:16:44,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-01-08 22:16:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:16:44,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:44,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:44,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:16:44,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:44,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1936168235, now seen corresponding path program 1 times [2025-01-08 22:16:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843174210] [2025-01-08 22:16:44,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:44,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:16:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:16:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:44,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843174210] [2025-01-08 22:16:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843174210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100194016] [2025-01-08 22:16:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:46,512 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-08 22:16:46,514 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-08 22:16:46,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:16:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:16:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:46,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-08 22:16:46,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:46,689 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-08 22:16:46,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:46,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 25 [2025-01-08 22:16:46,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:46,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 3 [2025-01-08 22:16:46,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:46,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:46,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 18 [2025-01-08 22:16:46,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:46,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:46,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2025-01-08 22:16:46,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:16:46,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:46,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 42 [2025-01-08 22:16:47,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-01-08 22:16:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:47,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:47,318 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 15 [2025-01-08 22:16:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-08 22:16:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100194016] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:47,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 7] total 22 [2025-01-08 22:16:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138589271] [2025-01-08 22:16:47,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:47,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:16:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:47,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:16:47,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:16:47,355 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:47,672 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2025-01-08 22:16:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:16:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-08 22:16:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:47,673 INFO L225 Difference]: With dead ends: 88 [2025-01-08 22:16:47,673 INFO L226 Difference]: Without dead ends: 60 [2025-01-08 22:16:47,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:16:47,674 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 131 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:47,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:16:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-08 22:16:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2025-01-08 22:16:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-01-08 22:16:47,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 31 [2025-01-08 22:16:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-01-08 22:16:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-01-08 22:16:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:16:47,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:47,679 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:16:47,685 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-08 22:16:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:47,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -856210461, now seen corresponding path program 1 times [2025-01-08 22:16:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849836643] [2025-01-08 22:16:47,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:47,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:16:47,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:16:47,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:47,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:16:48,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:48,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849836643] [2025-01-08 22:16:48,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849836643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:48,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909690420] [2025-01-08 22:16:48,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:48,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:48,747 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-08 22:16:48,749 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-08 22:16:48,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:16:48,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:16:48,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:48,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-08 22:16:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:48,904 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-08 22:16:48,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-01-08 22:16:48,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:48,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:48,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 18 [2025-01-08 22:16:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:49,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:49,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2025-01-08 22:16:49,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:16:49,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:49,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 42 [2025-01-08 22:16:49,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:49,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-01-08 22:16:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:16:49,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:49,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-08 22:16:49,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:16:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909690420] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:49,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:49,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 22 [2025-01-08 22:16:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587228053] [2025-01-08 22:16:49,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:49,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:16:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:16:49,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:16:49,381 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:49,796 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2025-01-08 22:16:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:16:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-08 22:16:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:49,797 INFO L225 Difference]: With dead ends: 85 [2025-01-08 22:16:49,797 INFO L226 Difference]: Without dead ends: 59 [2025-01-08 22:16:49,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:16:49,798 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 257 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:49,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 102 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:16:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-08 22:16:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2025-01-08 22:16:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-01-08 22:16:49,803 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 36 [2025-01-08 22:16:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-01-08 22:16:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-01-08 22:16:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:16:49,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:49,804 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2025-01-08 22:16:49,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:50,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2061230997, now seen corresponding path program 2 times [2025-01-08 22:16:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92311381] [2025-01-08 22:16:50,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:50,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-08 22:16:50,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:16:50,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:16:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92311381] [2025-01-08 22:16:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92311381] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953457321] [2025-01-08 22:16:50,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:50,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:50,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:50,646 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-08 22:16:50,649 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-08 22:16:50,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-08 22:16:50,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:16:50,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:50,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:50,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-08 22:16:50,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:50,798 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-08 22:16:50,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:50,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2025-01-08 22:16:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:16:50,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:50,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2025-01-08 22:16:50,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:16:50,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:50,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 42 [2025-01-08 22:16:51,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:51,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-01-08 22:16:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:16:51,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-08 22:16:51,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:16:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953457321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:51,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:51,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2025-01-08 22:16:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326851743] [2025-01-08 22:16:51,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:51,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-08 22:16:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:51,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-08 22:16:51,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:16:51,249 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:51,810 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-01-08 22:16:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:16:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-08 22:16:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:51,812 INFO L225 Difference]: With dead ends: 108 [2025-01-08 22:16:51,812 INFO L226 Difference]: Without dead ends: 81 [2025-01-08 22:16:51,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1355, Unknown=0, NotChecked=0, Total=1722 [2025-01-08 22:16:51,813 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 206 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:51,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 119 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:16:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-08 22:16:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 47. [2025-01-08 22:16:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-08 22:16:51,818 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 41 [2025-01-08 22:16:51,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:51,819 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-08 22:16:51,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-08 22:16:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:16:51,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:51,820 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-01-08 22:16:51,826 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-08 22:16:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:52,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:52,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1572946723, now seen corresponding path program 3 times [2025-01-08 22:16:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:52,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943413125] [2025-01-08 22:16:52,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:52,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-08 22:16:52,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:16:52,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-08 22:16:52,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:16:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943413125] [2025-01-08 22:16:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943413125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497909577] [2025-01-08 22:16:52,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:52,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:52,551 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-08 22:16:52,555 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-08 22:16:52,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-08 22:16:52,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:16:52,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-08 22:16:52,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:52,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-08 22:16:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:52,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 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:16:52,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:52,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 25 [2025-01-08 22:16:52,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-08 22:16:52,969 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:16:52,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 87 treesize of output 69 [2025-01-08 22:16:53,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:53,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-08 22:16:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:16:53,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:53,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-08 22:16:53,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:16:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497909577] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:53,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 10] total 29 [2025-01-08 22:16:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583217375] [2025-01-08 22:16:53,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-08 22:16:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-08 22:16:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:16:53,472 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 29 states, 29 states have (on average 4.379310344827586) internal successors, (127), 29 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:54,152 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-01-08 22:16:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:16:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.379310344827586) internal successors, (127), 29 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-08 22:16:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:54,153 INFO L225 Difference]: With dead ends: 89 [2025-01-08 22:16:54,153 INFO L226 Difference]: Without dead ends: 80 [2025-01-08 22:16:54,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2025-01-08 22:16:54,154 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 147 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:54,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 147 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:16:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-08 22:16:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2025-01-08 22:16:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-01-08 22:16:54,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 46 [2025-01-08 22:16:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:54,159 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-01-08 22:16:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.379310344827586) internal successors, (127), 29 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-01-08 22:16:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:16:54,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:54,160 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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] [2025-01-08 22:16:54,167 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-08 22:16:54,360 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,SelfDestructingSolverStorable8 [2025-01-08 22:16:54,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1867551659, now seen corresponding path program 4 times [2025-01-08 22:16:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237478408] [2025-01-08 22:16:54,361 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:54,370 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-08 22:16:54,378 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:16:54,378 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:54,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:54,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237478408] [2025-01-08 22:16:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237478408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:54,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398103425] [2025-01-08 22:16:54,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:54,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:54,690 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-08 22:16:54,691 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-08 22:16:54,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-01-08 22:16:54,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 22:16:54,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:54,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:54,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-08 22:16:54,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:54,806 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-08 22:16:54,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:16:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-01-08 22:16:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:54,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:55,024 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 15 [2025-01-08 22:16:55,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-08 22:16:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398103425] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:55,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:55,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 22 [2025-01-08 22:16:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722631124] [2025-01-08 22:16:55,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:55,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:16:55,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:55,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:16:55,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:16:55,029 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:55,372 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2025-01-08 22:16:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:16:55,373 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-08 22:16:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:55,373 INFO L225 Difference]: With dead ends: 83 [2025-01-08 22:16:55,373 INFO L226 Difference]: Without dead ends: 81 [2025-01-08 22:16:55,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:16:55,374 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:55,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 146 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:16:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-08 22:16:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2025-01-08 22:16:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-01-08 22:16:55,379 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 51 [2025-01-08 22:16:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-01-08 22:16:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-01-08 22:16:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-08 22:16:55,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:55,380 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 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-08 22:16:55,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:55,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:16:55,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1317352035, now seen corresponding path program 5 times [2025-01-08 22:16:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191653231] [2025-01-08 22:16:55,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:16:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:55,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-01-08 22:16:55,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 22:16:55,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:16:55,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191653231] [2025-01-08 22:16:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191653231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717182579] [2025-01-08 22:16:55,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:16:55,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:55,840 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-08 22:16:55,842 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-08 22:16:55,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-01-08 22:16:56,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 22:16:56,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:16:56,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:56,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:16:56,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:56,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:16:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717182579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:56,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2025-01-08 22:16:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831532254] [2025-01-08 22:16:56,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:56,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-08 22:16:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:56,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-08 22:16:56,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2025-01-08 22:16:56,790 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 33 states, 33 states have (on average 4.696969696969697) internal successors, (155), 33 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:57,045 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2025-01-08 22:16:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:16:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.696969696969697) internal successors, (155), 33 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-08 22:16:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:57,046 INFO L225 Difference]: With dead ends: 170 [2025-01-08 22:16:57,046 INFO L226 Difference]: Without dead ends: 82 [2025-01-08 22:16:57,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1022, Unknown=0, NotChecked=0, Total=1406 [2025-01-08 22:16:57,046 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 158 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:57,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 142 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:16:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-08 22:16:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-01-08 22:16:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-01-08 22:16:57,052 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 56 [2025-01-08 22:16:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:57,052 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-01-08 22:16:57,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.696969696969697) internal successors, (155), 33 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:16:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-01-08 22:16:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-08 22:16:57,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:57,053 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:57,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:57,253 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,SelfDestructingSolverStorable10 [2025-01-08 22:16:57,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1275125868, now seen corresponding path program 6 times [2025-01-08 22:16:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572317059] [2025-01-08 22:16:57,254 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:16:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:57,270 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-01-08 22:16:57,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-01-08 22:16:57,305 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:16:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:16:59,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572317059] [2025-01-08 22:16:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572317059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979367594] [2025-01-08 22:16:59,355 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:16:59,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:59,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:59,358 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-08 22:16:59,360 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-08 22:16:59,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-01-08 22:17:00,380 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-01-08 22:17:00,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:17:00,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:00,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:17:00,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:00,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-08 22:17:00,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 47 [2025-01-08 22:17:00,494 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-01-08 22:17:00,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2025-01-08 22:17:00,522 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-08 22:17:00,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 76 [2025-01-08 22:17:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:17:00,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:01,047 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 93 treesize of output 83 [2025-01-08 22:17:01,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-01-08 22:17:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:17:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979367594] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:01,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 37 [2025-01-08 22:17:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652290945] [2025-01-08 22:17:01,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:01,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-08 22:17:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:01,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-08 22:17:01,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:17:01,117 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 37 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:02,613 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2025-01-08 22:17:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-08 22:17:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 37 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-08 22:17:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:02,615 INFO L225 Difference]: With dead ends: 132 [2025-01-08 22:17:02,615 INFO L226 Difference]: Without dead ends: 123 [2025-01-08 22:17:02,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=633, Invalid=3527, Unknown=0, NotChecked=0, Total=4160 [2025-01-08 22:17:02,616 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 251 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:02,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 284 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:17:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-08 22:17:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 77. [2025-01-08 22:17:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-01-08 22:17:02,630 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 71 [2025-01-08 22:17:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:02,631 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-01-08 22:17:02,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 37 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-01-08 22:17:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-08 22:17:02,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:02,631 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:02,641 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-08 22:17:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:02,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -621328406, now seen corresponding path program 7 times [2025-01-08 22:17:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159341965] [2025-01-08 22:17:02,837 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:17:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:02,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:17:02,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:17:02,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:17:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:17:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:17:05,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159341965] [2025-01-08 22:17:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159341965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:17:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778874221] [2025-01-08 22:17:05,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:17:05,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:17:05,297 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-08 22:17:05,298 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-08 22:17:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:17:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:17:05,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:17:05,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:05,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-08 22:17:05,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:05,565 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-08 22:17:05,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-01-08 22:17:05,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:17:05,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-01-08 22:17:05,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-01-08 22:17:05,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 35 [2025-01-08 22:17:05,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-01-08 22:17:05,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 45 [2025-01-08 22:17:05,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-01-08 22:17:06,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 42 [2025-01-08 22:17:06,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-01-08 22:17:06,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 59 [2025-01-08 22:17:06,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 45 [2025-01-08 22:17:06,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 62 [2025-01-08 22:17:06,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:06,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 16 [2025-01-08 22:17:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:17:06,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:07,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-08 22:17:07,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:17:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:17:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778874221] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:07,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 15] total 65 [2025-01-08 22:17:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764683963] [2025-01-08 22:17:07,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-08 22:17:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:07,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-08 22:17:07,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3826, Unknown=0, NotChecked=0, Total=4160 [2025-01-08 22:17:07,521 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 65 states, 65 states have (on average 3.246153846153846) internal successors, (211), 65 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:14,627 INFO L93 Difference]: Finished difference Result 459 states and 517 transitions. [2025-01-08 22:17:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-01-08 22:17:14,628 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.246153846153846) internal successors, (211), 65 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-08 22:17:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:14,629 INFO L225 Difference]: With dead ends: 459 [2025-01-08 22:17:14,629 INFO L226 Difference]: Without dead ends: 399 [2025-01-08 22:17:14,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 116 SyntacticMatches, 9 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14236 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3411, Invalid=35991, Unknown=0, NotChecked=0, Total=39402 [2025-01-08 22:17:14,637 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1153 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 4731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:14,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 522 Invalid, 4731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 4183 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 22:17:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-08 22:17:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 113. [2025-01-08 22:17:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0714285714285714) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2025-01-08 22:17:14,663 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 76 [2025-01-08 22:17:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:14,663 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2025-01-08 22:17:14,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.246153846153846) internal successors, (211), 65 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2025-01-08 22:17:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-08 22:17:14,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:14,664 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:14,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:17:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:14,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:14,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash 204491758, now seen corresponding path program 8 times [2025-01-08 22:17:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618552162] [2025-01-08 22:17:14,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:17:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:14,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-08 22:17:14,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-08 22:17:14,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:17:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 132 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:17:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:17:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618552162] [2025-01-08 22:17:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618552162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:17:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539916858] [2025-01-08 22:17:16,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:17:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:17:16,277 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-08 22:17:16,278 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-08 22:17:16,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-08 22:17:16,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-08 22:17:16,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:17:16,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:16,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-08 22:17:16,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:16,553 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-08 22:17:16,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2025-01-08 22:17:16,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:17:16,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 35 [2025-01-08 22:17:16,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-01-08 22:17:16,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 42 [2025-01-08 22:17:16,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2025-01-08 22:17:16,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 59 [2025-01-08 22:17:16,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 45 [2025-01-08 22:17:16,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:16,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 62 [2025-01-08 22:17:17,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:17,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 16 [2025-01-08 22:17:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 142 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:17:17,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:17,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-08 22:17:17,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-08 22:17:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 128 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:17:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539916858] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:17,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 16] total 54 [2025-01-08 22:17:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51052114] [2025-01-08 22:17:17,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-08 22:17:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:17,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-08 22:17:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2589, Unknown=0, NotChecked=0, Total=2862 [2025-01-08 22:17:17,971 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 54 states, 54 states have (on average 4.018518518518518) internal successors, (217), 54 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:20,986 INFO L93 Difference]: Finished difference Result 281 states and 319 transitions. [2025-01-08 22:17:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-08 22:17:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.018518518518518) internal successors, (217), 54 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-08 22:17:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:20,987 INFO L225 Difference]: With dead ends: 281 [2025-01-08 22:17:20,987 INFO L226 Difference]: Without dead ends: 272 [2025-01-08 22:17:20,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1368, Invalid=11288, Unknown=0, NotChecked=0, Total=12656 [2025-01-08 22:17:20,989 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 760 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:20,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 465 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-08 22:17:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-08 22:17:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 118. [2025-01-08 22:17:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0683760683760684) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-01-08 22:17:21,004 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 81 [2025-01-08 22:17:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:21,004 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-01-08 22:17:21,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.018518518518518) internal successors, (217), 54 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-01-08 22:17:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-08 22:17:21,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:21,005 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:21,012 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-08 22:17:21,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:21,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:21,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1865602454, now seen corresponding path program 9 times [2025-01-08 22:17:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255158379] [2025-01-08 22:17:21,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:17:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:21,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-01-08 22:17:21,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-01-08 22:17:21,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-08 22:17:21,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 166 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:17:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:17:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255158379] [2025-01-08 22:17:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255158379] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:17:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400159006] [2025-01-08 22:17:21,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:17:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:17:21,928 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-08 22:17:21,930 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-08 22:17:22,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-01-08 22:17:23,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-01-08 22:17:23,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-08 22:17:23,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:23,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-08 22:17:23,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:23,823 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-08 22:17:23,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:23,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 25 [2025-01-08 22:17:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2025-01-08 22:17:23,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:23,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 35 [2025-01-08 22:17:23,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:23,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2025-01-08 22:17:24,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:24,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 52 [2025-01-08 22:17:24,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:17:24,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:24,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 42 [2025-01-08 22:17:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:17:24,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:17:24,120 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-08 22:17:24,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 105 treesize of output 89 [2025-01-08 22:17:24,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:17:24,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:24,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 16 [2025-01-08 22:17:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:17:24,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:25,447 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 77 treesize of output 71 [2025-01-08 22:17:25,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2025-01-08 22:17:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 161 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400159006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:25,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 17] total 52 [2025-01-08 22:17:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037585629] [2025-01-08 22:17:25,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-08 22:17:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:25,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-08 22:17:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2408, Unknown=0, NotChecked=0, Total=2652 [2025-01-08 22:17:25,534 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 52 states, 52 states have (on average 4.211538461538462) internal successors, (219), 52 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:28,786 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2025-01-08 22:17:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-08 22:17:28,790 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.211538461538462) internal successors, (219), 52 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-08 22:17:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:28,791 INFO L225 Difference]: With dead ends: 214 [2025-01-08 22:17:28,791 INFO L226 Difference]: Without dead ends: 205 [2025-01-08 22:17:28,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2788 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1274, Invalid=10068, Unknown=0, NotChecked=0, Total=11342 [2025-01-08 22:17:28,792 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 536 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:28,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 491 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-08 22:17:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-08 22:17:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 123. [2025-01-08 22:17:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.0655737704918034) internal successors, (130), 122 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2025-01-08 22:17:28,810 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 86 [2025-01-08 22:17:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:28,811 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2025-01-08 22:17:28,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.211538461538462) internal successors, (219), 52 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2025-01-08 22:17:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-08 22:17:28,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:28,813 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:28,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 22:17:29,017 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,SelfDestructingSolverStorable14 [2025-01-08 22:17:29,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 891550062, now seen corresponding path program 10 times [2025-01-08 22:17:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390485296] [2025-01-08 22:17:29,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:17:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:29,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-01-08 22:17:29,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 22:17:29,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:17:29,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:29,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:17:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390485296] [2025-01-08 22:17:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390485296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:17:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343748603] [2025-01-08 22:17:29,610 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:17:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:17:29,613 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-08 22:17:29,617 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-08 22:17:29,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-01-08 22:17:29,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 22:17:29,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:17:29,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:29,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-08 22:17:29,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:29,851 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-08 22:17:29,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:29,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-01-08 22:17:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:30,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:30,308 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 15 [2025-01-08 22:17:30,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-01-08 22:17:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343748603] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:30,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 34 [2025-01-08 22:17:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009804598] [2025-01-08 22:17:30,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-08 22:17:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:30,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-08 22:17:30,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:17:30,318 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:31,356 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2025-01-08 22:17:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-08 22:17:31,356 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-08 22:17:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:31,357 INFO L225 Difference]: With dead ends: 189 [2025-01-08 22:17:31,357 INFO L226 Difference]: Without dead ends: 187 [2025-01-08 22:17:31,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=518, Invalid=4452, Unknown=0, NotChecked=0, Total=4970 [2025-01-08 22:17:31,358 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:31,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 320 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:17:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-08 22:17:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 128. [2025-01-08 22:17:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2025-01-08 22:17:31,385 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 91 [2025-01-08 22:17:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2025-01-08 22:17:31,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2025-01-08 22:17:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-08 22:17:31,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:31,387 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:31,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:17:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:17:31,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:31,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 411692266, now seen corresponding path program 11 times [2025-01-08 22:17:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432281575] [2025-01-08 22:17:31,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:17:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:31,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-01-08 22:17:31,629 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-01-08 22:17:31,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-08 22:17:31,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:17:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432281575] [2025-01-08 22:17:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432281575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:17:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387267983] [2025-01-08 22:17:32,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:17:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:17:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:17:32,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:17:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:17:32,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-01-08 22:17:56,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-01-08 22:17:56,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-08 22:17:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:17:56,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-08 22:17:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:17:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 265 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:57,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:17:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 265 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:17:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387267983] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:17:57,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:17:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 48 [2025-01-08 22:17:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106722633] [2025-01-08 22:17:57,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:17:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-08 22:17:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:17:57,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-08 22:17:57,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1684, Unknown=0, NotChecked=0, Total=2256 [2025-01-08 22:17:57,943 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:17:58,366 INFO L93 Difference]: Finished difference Result 295 states and 316 transitions. [2025-01-08 22:17:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-08 22:17:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-08 22:17:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:17:58,367 INFO L225 Difference]: With dead ends: 295 [2025-01-08 22:17:58,367 INFO L226 Difference]: Without dead ends: 122 [2025-01-08 22:17:58,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 161 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=746, Invalid=2224, Unknown=0, NotChecked=0, Total=2970 [2025-01-08 22:17:58,370 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 202 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:17:58,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 295 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:17:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-08 22:17:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-01-08 22:17:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2025-01-08 22:17:58,386 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 96 [2025-01-08 22:17:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:17:58,386 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2025-01-08 22:17:58,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:17:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2025-01-08 22:17:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-08 22:17:58,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:17:58,389 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:17:58,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-08 22:17:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:17:58,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:17:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:17:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1770136307, now seen corresponding path program 12 times [2025-01-08 22:17:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:17:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711703086] [2025-01-08 22:17:58,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:17:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:17:58,609 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes. [2025-01-08 22:17:58,737 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 111 of 111 statements. [2025-01-08 22:17:58,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-01-08 22:17:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 48 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:18:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711703086] [2025-01-08 22:18:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711703086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320556246] [2025-01-08 22:18:12,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:18:12,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:12,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:12,263 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:18:12,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:18:12,379 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes.