./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/busybox-1.22.0/chgrp-incomplete-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8e036d03abaa2464843bef35227938cb8e4d04c5a12ab6a4a0003d6a8df9a501 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:57:51,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:57:51,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:57:51,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:57:51,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:57:51,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:57:51,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:57:51,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:57:51,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:57:51,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:57:51,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:57:51,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:57:51,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:57:51,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:57:51,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:57:51,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:57:51,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:57:51,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:57:51,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:57:51,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:57:51,760 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e036d03abaa2464843bef35227938cb8e4d04c5a12ab6a4a0003d6a8df9a501 [2025-02-06 17:57:52,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:57:52,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:57:52,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:57:52,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:57:52,034 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:57:52,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i [2025-02-06 17:57:53,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37959482/be6c5e7b60a5426d91ab34ea38c9d32a/FLAG1f864a085 [2025-02-06 17:57:53,507 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:57:53,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chgrp-incomplete-1.i [2025-02-06 17:57:53,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37959482/be6c5e7b60a5426d91ab34ea38c9d32a/FLAG1f864a085 [2025-02-06 17:57:53,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c37959482/be6c5e7b60a5426d91ab34ea38c9d32a [2025-02-06 17:57:53,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:57:53,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:57:53,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:57:53,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:57:53,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:57:53,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:57:53" (1/1) ... [2025-02-06 17:57:53,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a131163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:53, skipping insertion in model container [2025-02-06 17:57:53,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:57:53" (1/1) ... [2025-02-06 17:57:53,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:57:54,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:57:54,188 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:57:54,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:57:54,372 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 17:57:54,378 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:57:54,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54 WrapperNode [2025-02-06 17:57:54,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:57:54,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:57:54,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:57:54,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:57:54,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,467 INFO L138 Inliner]: procedures = 597, calls = 507, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 808 [2025-02-06 17:57:54,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:57:54,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:57:54,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:57:54,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:57:54,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,494 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 17:57:54,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:57:54,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:57:54,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:57:54,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:57:54,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (1/1) ... [2025-02-06 17:57:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:57:54,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:54,583 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-02-06 17:57:54,585 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-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-06 17:57:54,603 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:57:54,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 17:57:54,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 17:57:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 17:57:54,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 17:57:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 17:57:54,879 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:57:54,881 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:57:55,756 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2225: havoc chown_main_#t~nondet75#1; [2025-02-06 17:57:55,756 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: havoc xasprintf_#t~mem116#1.base, xasprintf_#t~mem116#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-02-06 17:57:55,817 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-02-06 17:57:55,817 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:57:55,834 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:57:55,834 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:57:55,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:57:55 BoogieIcfgContainer [2025-02-06 17:57:55,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:57:55,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:57:55,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:57:55,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:57:55,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:57:53" (1/3) ... [2025-02-06 17:57:55,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c71f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:57:55, skipping insertion in model container [2025-02-06 17:57:55,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:57:54" (2/3) ... [2025-02-06 17:57:55,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c71f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:57:55, skipping insertion in model container [2025-02-06 17:57:55,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:57:55" (3/3) ... [2025-02-06 17:57:55,842 INFO L128 eAbstractionObserver]: Analyzing ICFG chgrp-incomplete-1.i [2025-02-06 17:57:55,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:57:55,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chgrp-incomplete-1.i that has 4 procedures, 145 locations, 1 initial locations, 12 loop locations, and 32 error locations. [2025-02-06 17:57:55,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:57:55,912 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;@629e002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:57:55,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 17:57:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 135 states have internal predecessors, (168), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 17:57:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 17:57:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:55,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 17:57:55,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 6986943, now seen corresponding path program 1 times [2025-02-06 17:57:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982288628] [2025-02-06 17:57:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:56,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 17:57:56,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 17:57:56,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982288628] [2025-02-06 17:57:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982288628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395069248] [2025-02-06 17:57:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:56,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:56,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:56,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:56,567 INFO L87 Difference]: Start difference. First operand has 145 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 135 states have internal predecessors, (168), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:56,613 INFO L93 Difference]: Finished difference Result 192 states and 240 transitions. [2025-02-06 17:57:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 17:57:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:56,619 INFO L225 Difference]: With dead ends: 192 [2025-02-06 17:57:56,619 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 17:57:56,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:56,626 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 17:57:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 17:57:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-06 17:57:56,659 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 4 [2025-02-06 17:57:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:56,659 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-06 17:57:56,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-06 17:57:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 17:57:56,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:56,660 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 17:57:56,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:57:56,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:56,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1989748704, now seen corresponding path program 1 times [2025-02-06 17:57:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:56,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480112820] [2025-02-06 17:57:56,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:56,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:57:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:57:56,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480112820] [2025-02-06 17:57:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480112820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164446624] [2025-02-06 17:57:57,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:57,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:57,004 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-02-06 17:57:57,006 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-02-06 17:57:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:57:57,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:57:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:57,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:57:57,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:57,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164446624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 17:57:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265529937] [2025-02-06 17:57:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:57:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:57,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:57:57,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:57,353 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:57,374 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-06 17:57:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:57:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 17:57:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:57,375 INFO L225 Difference]: With dead ends: 49 [2025-02-06 17:57:57,375 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 17:57:57,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:57,376 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:57,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 17:57:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 17:57:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-06 17:57:57,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-02-06 17:57:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-06 17:57:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-06 17:57:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 17:57:57,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:57,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 17:57:57,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 17:57:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:57,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:57,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1552667841, now seen corresponding path program 1 times [2025-02-06 17:57:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:57,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697596311] [2025-02-06 17:57:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:57,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 17:57:57,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 17:57:57,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:57,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:57:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697596311] [2025-02-06 17:57:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697596311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:57:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393278331] [2025-02-06 17:57:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:57,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:57,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:57,816 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:57,833 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-06 17:57:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 17:57:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:57,835 INFO L225 Difference]: With dead ends: 48 [2025-02-06 17:57:57,835 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 17:57:57,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:57:57,836 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:57,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 17:57:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-02-06 17:57:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-06 17:57:57,841 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 8 [2025-02-06 17:57:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:57,842 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-06 17:57:57,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:57:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-06 17:57:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:57:57,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:57,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:57,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:57:57,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash -517106277, now seen corresponding path program 1 times [2025-02-06 17:57:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673312302] [2025-02-06 17:57:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:57,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:57:57,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:57:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673312302] [2025-02-06 17:57:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673312302] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215070237] [2025-02-06 17:57:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:58,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:58,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:58,101 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-02-06 17:57:58,102 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-02-06 17:57:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:57:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:57:58,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:58,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 17:57:58,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:57:58,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:57:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215070237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:58,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:57:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 17:57:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342724773] [2025-02-06 17:57:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:58,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:57:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:58,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:57:58,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:58,415 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:58,436 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-02-06 17:57:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:57:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 17:57:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:58,439 INFO L225 Difference]: With dead ends: 45 [2025-02-06 17:57:58,439 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 17:57:58,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:58,440 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:58,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 48 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 17:57:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 17:57:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 39 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-02-06 17:57:58,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2025-02-06 17:57:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-02-06 17:57:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-02-06 17:57:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:57:58,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:58,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:58,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 17:57:58,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:58,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:58,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1149574752, now seen corresponding path program 1 times [2025-02-06 17:57:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546605647] [2025-02-06 17:57:58,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:58,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:57:58,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:57:58,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:58,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546605647] [2025-02-06 17:57:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546605647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:57:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414991266] [2025-02-06 17:57:58,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:57:58,877 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-02-06 17:57:58,878 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-02-06 17:57:59,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:57:59,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:57:59,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:59,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:57:59,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:57:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:59,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:57:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:57:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414991266] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:57:59,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:57:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:57:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595018602] [2025-02-06 17:57:59,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:57:59,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:57:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:59,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:57:59,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:59,233 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:59,263 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2025-02-06 17:57:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:57:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-02-06 17:57:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:59,267 INFO L225 Difference]: With dead ends: 89 [2025-02-06 17:57:59,267 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 17:57:59,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:57:59,268 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:59,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 17:57:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 17:57:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-02-06 17:57:59,277 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2025-02-06 17:57:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:59,277 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-02-06 17:57:59,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:57:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-02-06 17:57:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:57:59,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:59,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:59,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 17:57:59,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:57:59,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1276372801, now seen corresponding path program 2 times [2025-02-06 17:57:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529004282] [2025-02-06 17:57:59,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:57:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:59,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 17:57:59,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 17:57:59,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 17:57:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:57:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:57:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:57:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529004282] [2025-02-06 17:57:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529004282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:57:59,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:57:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:57:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297513140] [2025-02-06 17:57:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:57:59,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:57:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:57:59,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:57:59,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:59,816 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:57:59,854 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-02-06 17:57:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:57:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 17:57:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:57:59,855 INFO L225 Difference]: With dead ends: 52 [2025-02-06 17:57:59,855 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 17:57:59,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:57:59,857 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:57:59,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 110 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:57:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 17:57:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 17:57:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.275) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-02-06 17:57:59,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2025-02-06 17:57:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:57:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-02-06 17:57:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:57:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-02-06 17:57:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 17:57:59,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:57:59,863 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:57:59,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:57:59,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:57:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:57:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 579042423, now seen corresponding path program 1 times [2025-02-06 17:57:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:57:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627140830] [2025-02-06 17:57:59,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:57:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:57:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 17:57:59,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 17:57:59,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:57:59,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:58:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627140830] [2025-02-06 17:58:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627140830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332721824] [2025-02-06 17:58:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:00,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:00,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:00,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:00,084 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:00,101 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-02-06 17:58:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 17:58:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:00,101 INFO L225 Difference]: With dead ends: 79 [2025-02-06 17:58:00,102 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 17:58:00,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:00,102 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:00,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 17:58:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 17:58:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.255813953488372) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-06 17:58:00,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 27 [2025-02-06 17:58:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-06 17:58:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-06 17:58:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:58:00,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:00,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:00,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:58:00,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:00,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1664306968, now seen corresponding path program 1 times [2025-02-06 17:58:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224335574] [2025-02-06 17:58:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:58:00,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:58:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:58:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224335574] [2025-02-06 17:58:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224335574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877015438] [2025-02-06 17:58:00,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:00,432 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-02-06 17:58:00,433 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-02-06 17:58:00,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:58:00,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:58:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:00,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:58:00,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 17:58:00,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 17:58:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877015438] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:00,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 17:58:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440539891] [2025-02-06 17:58:00,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:00,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 17:58:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:00,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 17:58:00,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:58:00,912 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:58:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:00,985 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2025-02-06 17:58:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 17:58:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-02-06 17:58:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:00,986 INFO L225 Difference]: With dead ends: 108 [2025-02-06 17:58:00,986 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 17:58:00,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:58:00,987 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:00,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 200 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:58:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 17:58:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 17:58:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-02-06 17:58:00,992 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 30 [2025-02-06 17:58:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:00,992 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-02-06 17:58:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:58:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-02-06 17:58:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 17:58:00,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:00,996 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:01,005 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-02-06 17:58:01,200 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-02-06 17:58:01,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 551169944, now seen corresponding path program 1 times [2025-02-06 17:58:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050500310] [2025-02-06 17:58:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:01,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 17:58:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 17:58:01,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:01,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:58:01,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050500310] [2025-02-06 17:58:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050500310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:01,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574194156] [2025-02-06 17:58:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:01,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:01,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:01,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:01,436 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:01,464 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-02-06 17:58:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:01,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 17:58:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:01,465 INFO L225 Difference]: With dead ends: 82 [2025-02-06 17:58:01,466 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 17:58:01,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:01,466 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:01,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 17:58:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-02-06 17:58:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-06 17:58:01,474 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 48 [2025-02-06 17:58:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:01,474 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-06 17:58:01,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-06 17:58:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 17:58:01,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:01,475 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 17:58:01,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1620304101, now seen corresponding path program 1 times [2025-02-06 17:58:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380285881] [2025-02-06 17:58:01,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:01,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 17:58:01,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 17:58:01,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:01,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380285881] [2025-02-06 17:58:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380285881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:01,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 17:58:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055090052] [2025-02-06 17:58:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:01,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:58:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:01,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:58:01,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:58:01,918 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:01,972 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-02-06 17:58:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:58:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 17:58:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:01,973 INFO L225 Difference]: With dead ends: 96 [2025-02-06 17:58:01,973 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 17:58:01,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:58:01,974 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:01,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 115 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 17:58:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-02-06 17:58:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2025-02-06 17:58:01,979 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 49 [2025-02-06 17:58:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2025-02-06 17:58:01,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2025-02-06 17:58:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 17:58:01,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:01,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:01,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 17:58:01,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -93595815, now seen corresponding path program 1 times [2025-02-06 17:58:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10249992] [2025-02-06 17:58:01,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:02,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 17:58:02,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 17:58:02,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:02,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:58:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10249992] [2025-02-06 17:58:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10249992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422698000] [2025-02-06 17:58:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:02,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:02,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:02,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:02,176 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:02,188 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2025-02-06 17:58:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 17:58:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:02,189 INFO L225 Difference]: With dead ends: 79 [2025-02-06 17:58:02,189 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 17:58:02,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:02,190 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:02,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 17:58:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-02-06 17:58:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-02-06 17:58:02,194 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 49 [2025-02-06 17:58:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:02,194 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-02-06 17:58:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-02-06 17:58:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:58:02,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:02,195 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 17:58:02,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 288201999, now seen corresponding path program 1 times [2025-02-06 17:58:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490016857] [2025-02-06 17:58:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:02,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:58:02,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:58:02,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:58:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490016857] [2025-02-06 17:58:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490016857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945602617] [2025-02-06 17:58:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:02,437 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-02-06 17:58:02,439 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-02-06 17:58:02,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:58:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:58:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:02,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:58:02,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:58:02,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:58:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945602617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:02,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:58:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871044663] [2025-02-06 17:58:02,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:58:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:02,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:58:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:02,882 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:02,907 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2025-02-06 17:58:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:58:02,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 17:58:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:02,908 INFO L225 Difference]: With dead ends: 119 [2025-02-06 17:58:02,908 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 17:58:02,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:02,908 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:02,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 17:58:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 17:58:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.119047619047619) internal successors, (94), 88 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-02-06 17:58:02,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 55 [2025-02-06 17:58:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:02,913 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-02-06 17:58:02,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-02-06 17:58:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 17:58:02,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:02,914 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:02,923 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-02-06 17:58:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 17:58:03,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash -30680733, now seen corresponding path program 1 times [2025-02-06 17:58:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776727263] [2025-02-06 17:58:03,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:03,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 17:58:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 17:58:03,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776727263] [2025-02-06 17:58:03,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776727263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839011478] [2025-02-06 17:58:03,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:03,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:03,451 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-02-06 17:58:03,453 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-02-06 17:58:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 17:58:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 17:58:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:03,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:58:03,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:03,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839011478] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:04,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 17:58:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337399150] [2025-02-06 17:58:04,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:04,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 17:58:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:04,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 17:58:04,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 17:58:04,045 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:04,099 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2025-02-06 17:58:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 17:58:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2025-02-06 17:58:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:04,101 INFO L225 Difference]: With dead ends: 164 [2025-02-06 17:58:04,102 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 17:58:04,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 17:58:04,102 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:04,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 17:58:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-06 17:58:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 120 states have (on average 1.0833333333333333) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2025-02-06 17:58:04,113 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 65 [2025-02-06 17:58:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:04,113 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2025-02-06 17:58:04,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2025-02-06 17:58:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 17:58:04,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:04,117 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:04,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 17:58:04,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 17:58:04,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-06 17:58:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1496741245, now seen corresponding path program 2 times [2025-02-06 17:58:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347961209] [2025-02-06 17:58:04,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:58:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:04,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 17:58:04,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 17:58:04,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 17:58:04,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-02-06 17:58:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347961209] [2025-02-06 17:58:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347961209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287567368] [2025-02-06 17:58:10,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:58:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:10,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:58:10,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 17:58:10,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 17:58:12,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 17:58:12,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 17:58:12,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1677 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-06 17:58:12,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:12,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 17:58:12,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 17:58:12,107 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 17:58:12,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 17:58:12,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 17:58:12,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 17:58:12,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 112 [2025-02-06 17:58:12,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 17:58:12,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2025-02-06 17:58:12,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 17:58:12,198 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-02-06 17:58:12,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 52 [2025-02-06 17:58:12,215 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 17:58:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-06 17:58:12,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 17:58:12,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 98 [2025-02-06 17:58:12,246 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 17:58:12,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,390 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,488 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 17:58:12,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2025-02-06 17:58:12,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,662 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,770 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,821 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,877 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:12,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 17:58:12,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 17:58:12,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-02-06 17:58:13,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 17:58:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-06 17:58:13,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:25,019 INFO L349 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2025-02-06 17:58:25,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 2987 treesize of output 3002 [2025-02-06 17:58:25,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 17:58:25,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2953 treesize of output 1348 [2025-02-06 17:58:27,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5291398396 treesize of output 4987268487