./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.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-multidimensional/copy-partial-2-n-u.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 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:27:47,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:27:47,294 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:27:47,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:27:47,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:27:47,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:27:47,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:27:47,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:27:47,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:27:47,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:27:47,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:27:47,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:27:47,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:27:47,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:27:47,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:27:47,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:47,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:47,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:47,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:27:47,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:27:47,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:27:47,329 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 -> 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee [2025-01-08 22:27:47,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:27:47,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:27:47,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:27:47,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:27:47,552 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:27:47,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-01-08 22:27:48,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176b0835d/3750f61c3e584a5ba7c585a5e7492a81/FLAG889d80db9 [2025-01-08 22:27:48,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:27:48,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-01-08 22:27:48,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176b0835d/3750f61c3e584a5ba7c585a5e7492a81/FLAG889d80db9 [2025-01-08 22:27:49,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176b0835d/3750f61c3e584a5ba7c585a5e7492a81 [2025-01-08 22:27:49,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:27:49,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:27:49,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:49,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:27:49,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:27:49,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49, skipping insertion in model container [2025-01-08 22:27:49,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:27:49,345 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-multidimensional/copy-partial-2-n-u.c[416,429] [2025-01-08 22:27:49,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:49,368 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:27:49,375 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-multidimensional/copy-partial-2-n-u.c[416,429] [2025-01-08 22:27:49,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:49,393 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:27:49,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49 WrapperNode [2025-01-08 22:27:49,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:49,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:49,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:27:49,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:27:49,400 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:27:49" (1/1) ... [2025-01-08 22:27:49,404 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:27:49" (1/1) ... [2025-01-08 22:27:49,415 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-01-08 22:27:49,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:49,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:27:49,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:27:49,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:27:49,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,434 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-08 22:27:49,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:27:49,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:27:49,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:27:49,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:27:49,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (1/1) ... [2025-01-08 22:27:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:49,477 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:27:49,480 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:27:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:27:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-08 22:27:49,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-08 22:27:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:27:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:27:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:27:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:27:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:27:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:27:49,552 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:27:49,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:27:49,653 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-08 22:27:49,653 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:27:49,661 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:27:49,661 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:27:49,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:49 BoogieIcfgContainer [2025-01-08 22:27:49,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:27:49,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:27:49,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:27:49,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:27:49,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:27:49" (1/3) ... [2025-01-08 22:27:49,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73dac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:49, skipping insertion in model container [2025-01-08 22:27:49,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:49" (2/3) ... [2025-01-08 22:27:49,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73dac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:49, skipping insertion in model container [2025-01-08 22:27:49,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:49" (3/3) ... [2025-01-08 22:27:49,668 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u.c [2025-01-08 22:27:49,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:27:49,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-2-n-u.c that has 2 procedures, 22 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-08 22:27:49,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:27:49,729 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;@47fca81e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:27:49,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:27:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:27:49,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:49,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:49,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:49,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash -369868392, now seen corresponding path program 1 times [2025-01-08 22:27:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391450372] [2025-01-08 22:27:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:49,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:27:49,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:27:49,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:49,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391450372] [2025-01-08 22:27:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391450372] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257201011] [2025-01-08 22:27:49,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:49,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:49,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:49,880 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:27:49,882 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:27:49,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:27:49,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:27:49,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:49,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-08 22:27:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:27:49,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:27:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257201011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:27:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-08 22:27:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736424629] [2025-01-08 22:27:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:27:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:49,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:27:49,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:27:49,992 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:50,004 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2025-01-08 22:27:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:27:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-01-08 22:27:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:50,009 INFO L225 Difference]: With dead ends: 41 [2025-01-08 22:27:50,010 INFO L226 Difference]: Without dead ends: 19 [2025-01-08 22:27:50,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:27:50,013 INFO L435 NwaCegarLoop]: 28 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, 28 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:27:50,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-08 22:27:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-08 22:27:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-01-08 22:27:50,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 19 [2025-01-08 22:27:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:50,035 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-01-08 22:27:50,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-01-08 22:27:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:27:50,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:50,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:50,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:27:50,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-08 22:27:50,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:50,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2042759080, now seen corresponding path program 1 times [2025-01-08 22:27:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070566133] [2025-01-08 22:27:50,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:50,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:27:50,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:27:50,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:27:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070566133] [2025-01-08 22:27:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070566133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249335355] [2025-01-08 22:27:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:50,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:50,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,368 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:50,411 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2025-01-08 22:27:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-01-08 22:27:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:50,412 INFO L225 Difference]: With dead ends: 29 [2025-01-08 22:27:50,413 INFO L226 Difference]: Without dead ends: 21 [2025-01-08 22:27:50,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,414 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:50,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-08 22:27:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-01-08 22:27:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-01-08 22:27:50,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 19 [2025-01-08 22:27:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-01-08 22:27:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-01-08 22:27:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:27:50,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:50,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:27:50,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1354818434, now seen corresponding path program 1 times [2025-01-08 22:27:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212004690] [2025-01-08 22:27:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:50,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:27:50,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:27:50,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,508 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:27:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212004690] [2025-01-08 22:27:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212004690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299535519] [2025-01-08 22:27:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:50,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:50,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:50,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,510 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:50,542 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-01-08 22:27:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-08 22:27:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:50,543 INFO L225 Difference]: With dead ends: 37 [2025-01-08 22:27:50,543 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:27:50,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,543 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:50,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:27:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-01-08 22:27:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-01-08 22:27:50,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 21 [2025-01-08 22:27:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:50,547 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-01-08 22:27:50,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-01-08 22:27:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:27:50,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:50,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:27:50,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -362725185, now seen corresponding path program 1 times [2025-01-08 22:27:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868018310] [2025-01-08 22:27:50,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:50,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:27:50,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:27:50,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868018310] [2025-01-08 22:27:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868018310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:50,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576500574] [2025-01-08 22:27:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:50,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:50,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:50,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,627 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:50,669 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-01-08 22:27:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-08 22:27:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:50,672 INFO L225 Difference]: With dead ends: 37 [2025-01-08 22:27:50,672 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:27:50,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,673 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:50,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:27:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2025-01-08 22:27:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-01-08 22:27:50,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 22 [2025-01-08 22:27:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-01-08 22:27:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-01-08 22:27:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:27:50,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:50,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:27:50,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 623978457, now seen corresponding path program 1 times [2025-01-08 22:27:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613726200] [2025-01-08 22:27:50,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:50,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:27:50,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:27:50,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613726200] [2025-01-08 22:27:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613726200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936995253] [2025-01-08 22:27:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:50,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:50,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:50,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,783 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:50,809 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-01-08 22:27:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:50,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-08 22:27:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:50,810 INFO L225 Difference]: With dead ends: 36 [2025-01-08 22:27:50,810 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:27:50,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:50,811 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:50,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:27:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-01-08 22:27:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-01-08 22:27:50,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 24 [2025-01-08 22:27:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-01-08 22:27:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-08 22:27:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-01-08 22:27:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:27:50,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:50,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:27:50,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 327381176, now seen corresponding path program 1 times [2025-01-08 22:27:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186497982] [2025-01-08 22:27:50,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:27:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:27:50,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:50,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186497982] [2025-01-08 22:27:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186497982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120495139] [2025-01-08 22:27:50,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:50,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:50,886 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:27:50,888 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:27:50,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:27:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:27:50,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:50,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:50,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:50,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120495139] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:51,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958763200] [2025-01-08 22:27:51,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:51,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:51,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:51,039 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:27:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:51,106 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-01-08 22:27:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-01-08 22:27:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:51,107 INFO L225 Difference]: With dead ends: 63 [2025-01-08 22:27:51,107 INFO L226 Difference]: Without dead ends: 49 [2025-01-08 22:27:51,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:27:51,108 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 120 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:51,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-08 22:27:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2025-01-08 22:27:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-01-08 22:27:51,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2025-01-08 22:27:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:51,117 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-01-08 22:27:51,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:27:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-01-08 22:27:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:27:51,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:51,119 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:51,124 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:27:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:51,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -596436903, now seen corresponding path program 2 times [2025-01-08 22:27:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794317043] [2025-01-08 22:27:51,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:51,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-08 22:27:51,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:27:51,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:27:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794317043] [2025-01-08 22:27:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794317043] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279663781] [2025-01-08 22:27:51,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:51,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:51,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:51,381 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:27:51,382 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:27:51,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-08 22:27:51,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:27:51,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:51,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:27:51,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:51,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:27:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279663781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:51,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-01-08 22:27:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077958403] [2025-01-08 22:27:51,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:27:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:51,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:27:51,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:27:51,580 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-08 22:27:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:52,253 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2025-01-08 22:27:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-08 22:27:52,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2025-01-08 22:27:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:52,255 INFO L225 Difference]: With dead ends: 131 [2025-01-08 22:27:52,256 INFO L226 Difference]: Without dead ends: 114 [2025-01-08 22:27:52,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1005, Invalid=1965, Unknown=0, NotChecked=0, Total=2970 [2025-01-08 22:27:52,259 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 183 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:52,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 128 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-08 22:27:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 45. [2025-01-08 22:27:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-01-08 22:27:52,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 28 [2025-01-08 22:27:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:52,274 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-01-08 22:27:52,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-08 22:27:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-01-08 22:27:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:27:52,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:52,275 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:52,283 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:27:52,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:52,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash 182880883, now seen corresponding path program 3 times [2025-01-08 22:27:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-01-08 22:27:52,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:52,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 13 equivalence classes. [2025-01-08 22:27:52,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 46 statements. [2025-01-08 22:27:52,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-08 22:27:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-01-08 22:27:52,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168715053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676633762] [2025-01-08 22:27:52,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:52,548 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:27:52,550 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:27:52,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 13 equivalence classes. [2025-01-08 22:27:52,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 46 statements. [2025-01-08 22:27:52,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:52,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:52,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-08 22:27:52,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-08 22:27:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676633762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:52,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110830403] [2025-01-08 22:27:52,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:52,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:52,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:52,734 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:27:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:52,827 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-01-08 22:27:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:52,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-01-08 22:27:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:52,828 INFO L225 Difference]: With dead ends: 118 [2025-01-08 22:27:52,828 INFO L226 Difference]: Without dead ends: 111 [2025-01-08 22:27:52,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:27:52,829 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:52,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 50 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-08 22:27:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 54. [2025-01-08 22:27:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-01-08 22:27:52,839 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 46 [2025-01-08 22:27:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-01-08 22:27:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:27:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-01-08 22:27:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 22:27:52,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:52,841 INFO L218 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:52,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:27:53,041 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,SelfDestructingSolverStorable7 [2025-01-08 22:27:53,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 795018276, now seen corresponding path program 4 times [2025-01-08 22:27:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-01-08 22:27:53,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:53,055 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-08 22:27:53,062 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 55 statements. [2025-01-08 22:27:53,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:27:53,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 23 proven. 138 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-08 22:27:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-01-08 22:27:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143240730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528014095] [2025-01-08 22:27:53,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:53,205 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:27:53,212 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:27:53,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-08 22:27:53,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 55 statements. [2025-01-08 22:27:53,283 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:27:53,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:53,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:27:53,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 34 proven. 127 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-08 22:27:53,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 34 proven. 127 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-08 22:27:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528014095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:53,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-01-08 22:27:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804952726] [2025-01-08 22:27:53,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:53,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-08 22:27:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:53,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-08 22:27:53,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2025-01-08 22:27:53,715 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:27:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:53,911 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2025-01-08 22:27:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 22:27:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2025-01-08 22:27:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:53,912 INFO L225 Difference]: With dead ends: 122 [2025-01-08 22:27:53,912 INFO L226 Difference]: Without dead ends: 92 [2025-01-08 22:27:53,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:27:53,913 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:53,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 102 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-08 22:27:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-01-08 22:27:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 86 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-08 22:27:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-01-08 22:27:53,929 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 55 [2025-01-08 22:27:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:53,929 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-01-08 22:27:53,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-08 22:27:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-01-08 22:27:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-08 22:27:53,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:53,930 INFO L218 NwaCegarLoop]: trace histogram [50, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:53,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:27:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:54,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -562737546, now seen corresponding path program 5 times [2025-01-08 22:27:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645347899] [2025-01-08 22:27:54,131 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:27:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:54,160 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 91 statements into 31 equivalence classes. [2025-01-08 22:27:54,365 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 22:27:54,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-01-08 22:27:54,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 735 proven. 297 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-01-08 22:27:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645347899] [2025-01-08 22:27:54,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645347899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106260177] [2025-01-08 22:27:54,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:27:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:54,684 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:27:54,686 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:27:54,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 91 statements into 31 equivalence classes.