./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.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 ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:50,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:50,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:50,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:50,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:50,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:50,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:50,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:50,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:50,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:50,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:50,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:50,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:50,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:50,148 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:50,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:50,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:50,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:50,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:50,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:50,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:50,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:50,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:50,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:50,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:50,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:50,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:50,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:50,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:50,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:50,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:50,152 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 -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-01-10 06:00:50,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:50,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:50,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:50,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:50,428 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:50,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-01-10 06:00:51,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a600c0d40/b3fd37e4b3764ccbb8f3c3acd1b99c95/FLAG22d9b8c06 [2025-01-10 06:00:52,485 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:52,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-01-10 06:00:52,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a600c0d40/b3fd37e4b3764ccbb8f3c3acd1b99c95/FLAG22d9b8c06 [2025-01-10 06:00:52,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a600c0d40/b3fd37e4b3764ccbb8f3c3acd1b99c95 [2025-01-10 06:00:52,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:52,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:52,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:52,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:52,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:52,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:52" (1/1) ... [2025-01-10 06:00:52,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc4922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:52, skipping insertion in model container [2025-01-10 06:00:52,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:52" (1/1) ... [2025-01-10 06:00:52,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:53,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:54,025 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:54,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:54,533 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:00:54,549 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:54,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54 WrapperNode [2025-01-10 06:00:54,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:54,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:54,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:54,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:54,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,783 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 1002 [2025-01-10 06:00:54,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:54,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:54,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:54,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:54,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,862 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:00:54,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:55,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:00:55,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:00:55,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:00:55,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:00:55,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:55,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:55,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:00:55,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-01-10 06:00:55,087 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:00:55,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:00:55,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:00:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-01-10 06:00:55,087 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:00:55,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:00:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:00:55,401 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:00:55,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:00:56,720 INFO L? ?]: Removed 269 outVars from TransFormulas that were not future-live. [2025-01-10 06:00:56,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:00:56,735 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:00:56,737 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 06:00:56,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:56 BoogieIcfgContainer [2025-01-10 06:00:56,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:00:56,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:00:56,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:00:56,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:00:56,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:52" (1/3) ... [2025-01-10 06:00:56,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ead2d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:56, skipping insertion in model container [2025-01-10 06:00:56,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54" (2/3) ... [2025-01-10 06:00:56,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ead2d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:56, skipping insertion in model container [2025-01-10 06:00:56,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:56" (3/3) ... [2025-01-10 06:00:56,746 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-01-10 06:00:56,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:00:56,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 191 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-01-10 06:00:56,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:00:56,817 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;@48795a4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:00:56,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-10 06:00:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 139 states have (on average 1.589928057553957) internal successors, (221), 175 states have internal predecessors, (221), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:00:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:00:56,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:56,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:00:56,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:00:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 8991044, now seen corresponding path program 1 times [2025-01-10 06:00:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630546327] [2025-01-10 06:00:56,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:00:57,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:00:57,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630546327] [2025-01-10 06:00:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630546327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:57,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302050074] [2025-01-10 06:00:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:57,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:57,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:57,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:57,535 INFO L87 Difference]: Start difference. First operand has 191 states, 139 states have (on average 1.589928057553957) internal successors, (221), 175 states have internal predecessors, (221), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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-01-10 06:00:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:57,581 INFO L93 Difference]: Finished difference Result 293 states and 388 transitions. [2025-01-10 06:00:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:57,583 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-01-10 06:00:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:57,588 INFO L225 Difference]: With dead ends: 293 [2025-01-10 06:00:57,588 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 06:00:57,592 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-01-10 06:00:57,594 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 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-01-10 06:00:57,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 06:00:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-10 06:00:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 93 states have internal predecessors, (112), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:00:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2025-01-10 06:00:57,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 4 [2025-01-10 06:00:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:57,626 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2025-01-10 06:00:57,626 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-01-10 06:00:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2025-01-10 06:00:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:00:57,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:57,627 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:00:57,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:00:57,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:00:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1564519212, now seen corresponding path program 1 times [2025-01-10 06:00:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196320376] [2025-01-10 06:00:57,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:00:57,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:00:57,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:57,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196320376] [2025-01-10 06:00:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196320376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507094307] [2025-01-10 06:00:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:58,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:00:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:00:58,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:00:58,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:00:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:58,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:00:58,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:58,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:00:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507094307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:00:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:00:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121069259] [2025-01-10 06:00:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:58,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:00:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:58,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:00:58,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:58,514 INFO L87 Difference]: Start difference. First operand 103 states and 127 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-01-10 06:00:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:58,539 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2025-01-10 06:00:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:00:58,539 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-01-10 06:00:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:58,540 INFO L225 Difference]: With dead ends: 103 [2025-01-10 06:00:58,540 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 06:00:58,541 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-01-10 06:00:58,541 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 06:00:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-10 06:00:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 92 states have internal predecessors, (111), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:00:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-01-10 06:00:58,548 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 7 [2025-01-10 06:00:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:58,548 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-01-10 06:00:58,548 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-01-10 06:00:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-01-10 06:00:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:00:58,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:58,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:00:58,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:00:58,753 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-01-10 06:00:58,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:00:58,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1255455618, now seen corresponding path program 1 times [2025-01-10 06:00:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009781327] [2025-01-10 06:00:58,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:58,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:00:58,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:00:58,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:58,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:00:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009781327] [2025-01-10 06:00:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009781327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124033613] [2025-01-10 06:00:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:59,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:59,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:59,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:59,037 INFO L87 Difference]: Start difference. First operand 102 states and 126 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-01-10 06:00:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:59,052 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2025-01-10 06:00:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:59,060 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-01-10 06:00:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:59,061 INFO L225 Difference]: With dead ends: 102 [2025-01-10 06:00:59,061 INFO L226 Difference]: Without dead ends: 101 [2025-01-10 06:00:59,061 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-01-10 06:00:59,062 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 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-01-10 06:00:59,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-10 06:00:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-01-10 06:00:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:00:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-01-10 06:00:59,068 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 8 [2025-01-10 06:00:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-01-10 06:00:59,068 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-01-10 06:00:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-01-10 06:00:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:00:59,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:59,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:59,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:00:59,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:00:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1869858682, now seen corresponding path program 1 times [2025-01-10 06:00:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649040486] [2025-01-10 06:00:59,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:59,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:00:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:00:59,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:59,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649040486] [2025-01-10 06:00:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649040486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304493411] [2025-01-10 06:00:59,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:59,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:00:59,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:00:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:00:59,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:00:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:59,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:00:59,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:00:59,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:00:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304493411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:00:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:00:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905143778] [2025-01-10 06:00:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:59,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:59,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:59,838 INFO L87 Difference]: Start difference. First operand 99 states and 123 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-01-10 06:00:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:59,873 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2025-01-10 06:00:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:59,874 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-01-10 06:00:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:59,875 INFO L225 Difference]: With dead ends: 99 [2025-01-10 06:00:59,875 INFO L226 Difference]: Without dead ends: 97 [2025-01-10 06:00:59,875 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-01-10 06:00:59,875 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 152 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-01-10 06:00:59,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-10 06:00:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-10 06:00:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 87 states have internal predecessors, (106), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:00:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2025-01-10 06:00:59,882 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 12 [2025-01-10 06:00:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:59,883 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2025-01-10 06:00:59,883 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-01-10 06:00:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2025-01-10 06:00:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:00:59,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:59,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:59,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:00,084 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-01-10 06:01:00,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2131044603, now seen corresponding path program 1 times [2025-01-10 06:01:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334400026] [2025-01-10 06:01:00,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:00,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:00,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:00,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:00,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334400026] [2025-01-10 06:01:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334400026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115252041] [2025-01-10 06:01:00,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:00,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:00,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:00,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:01:00,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:00,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:00,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:00,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:00,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115252041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:00,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352460145] [2025-01-10 06:01:00,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:00,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:00,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:00,838 INFO L87 Difference]: Start difference. First operand 97 states and 121 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-01-10 06:01:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:00,867 INFO L93 Difference]: Finished difference Result 197 states and 247 transitions. [2025-01-10 06:01:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:00,868 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-01-10 06:01:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:00,869 INFO L225 Difference]: With dead ends: 197 [2025-01-10 06:01:00,869 INFO L226 Difference]: Without dead ends: 106 [2025-01-10 06:01:00,869 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-01-10 06:01:00,870 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 347 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-10 06:01:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-10 06:01:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.369047619047619) internal successors, (115), 96 states have internal predecessors, (115), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2025-01-10 06:01:00,876 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 13 [2025-01-10 06:01:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2025-01-10 06:01:00,877 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-01-10 06:01:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2025-01-10 06:01:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:01:00,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:00,877 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:00,887 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-01-10 06:01:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:01,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:01,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -860574957, now seen corresponding path program 2 times [2025-01-10 06:01:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722388314] [2025-01-10 06:01:01,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:01,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:01:01,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:01:01,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:01,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722388314] [2025-01-10 06:01:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722388314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143614755] [2025-01-10 06:01:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:01,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:01,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:01,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:01,536 INFO L87 Difference]: Start difference. First operand 106 states and 130 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-01-10 06:01:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:01,610 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2025-01-10 06:01:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:01,611 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-01-10 06:01:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:01,612 INFO L225 Difference]: With dead ends: 106 [2025-01-10 06:01:01,614 INFO L226 Difference]: Without dead ends: 104 [2025-01-10 06:01:01,614 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-01-10 06:01:01,615 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 69 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:01,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 346 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-10 06:01:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-10 06:01:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 94 states have internal predecessors, (113), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2025-01-10 06:01:01,631 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 22 [2025-01-10 06:01:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:01,631 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2025-01-10 06:01:01,631 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-01-10 06:01:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2025-01-10 06:01:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:01:01,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:01,636 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:01:01,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:01,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 43773130, now seen corresponding path program 1 times [2025-01-10 06:01:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453769868] [2025-01-10 06:01:01,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:01:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:01:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453769868] [2025-01-10 06:01:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453769868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082032951] [2025-01-10 06:01:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:02,004 INFO L87 Difference]: Start difference. First operand 104 states and 128 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-01-10 06:01:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:02,028 INFO L93 Difference]: Finished difference Result 191 states and 240 transitions. [2025-01-10 06:01:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:02,029 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-01-10 06:01:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:02,029 INFO L225 Difference]: With dead ends: 191 [2025-01-10 06:01:02,030 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 06:01:02,030 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-01-10 06:01:02,030 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 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-01-10 06:01:02,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 06:01:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-10 06:01:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 97 states have internal predecessors, (116), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2025-01-10 06:01:02,037 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 27 [2025-01-10 06:01:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:02,037 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2025-01-10 06:01:02,037 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-01-10 06:01:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2025-01-10 06:01:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 06:01:02,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:02,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:01:02,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -868333266, now seen corresponding path program 1 times [2025-01-10 06:01:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291160413] [2025-01-10 06:01:02,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:02,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:01:02,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:01:02,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:02,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291160413] [2025-01-10 06:01:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291160413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830377525] [2025-01-10 06:01:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:02,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:02,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:02,273 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-01-10 06:01:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:02,290 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2025-01-10 06:01:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:02,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 29 [2025-01-10 06:01:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:02,291 INFO L225 Difference]: With dead ends: 112 [2025-01-10 06:01:02,291 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 06:01:02,291 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-01-10 06:01:02,292 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:02,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 06:01:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-10 06:01:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 100 states have internal predecessors, (119), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2025-01-10 06:01:02,298 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 29 [2025-01-10 06:01:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:02,298 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2025-01-10 06:01:02,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-01-10 06:01:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2025-01-10 06:01:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:01:02,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:02,299 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-01-10 06:01:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:01:02,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:02,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1624419555, now seen corresponding path program 1 times [2025-01-10 06:01:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389276344] [2025-01-10 06:01:02,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:01:02,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:01:02,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:02,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389276344] [2025-01-10 06:01:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389276344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472866974] [2025-01-10 06:01:02,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:02,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:02,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:01:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:01:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:01:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:03,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:01:03,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:01:03,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:01:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472866974] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:03,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:03,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:01:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204301720] [2025-01-10 06:01:03,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:01:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:03,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:01:03,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:01:03,132 INFO L87 Difference]: Start difference. First operand 110 states and 134 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-01-10 06:01:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:03,224 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2025-01-10 06:01:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:01:03,225 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-01-10 06:01:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:03,226 INFO L225 Difference]: With dead ends: 222 [2025-01-10 06:01:03,226 INFO L226 Difference]: Without dead ends: 127 [2025-01-10 06:01:03,226 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-01-10 06:01:03,226 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:03,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 751 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-10 06:01:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-10 06:01:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 117 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2025-01-10 06:01:03,233 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 30 [2025-01-10 06:01:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:03,233 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2025-01-10 06:01:03,233 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-01-10 06:01:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2025-01-10 06:01:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:01:03,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:03,234 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-01-10 06:01:03,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:01:03,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 06:01:03,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:03,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 317315293, now seen corresponding path program 1 times [2025-01-10 06:01:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133410146] [2025-01-10 06:01:03,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:03,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:01:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:01:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133410146] [2025-01-10 06:01:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133410146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:03,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:03,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361521616] [2025-01-10 06:01:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:03,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:03,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:03,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:03,731 INFO L87 Difference]: Start difference. First operand 127 states and 151 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-01-10 06:01:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:03,760 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2025-01-10 06:01:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:03,760 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-01-10 06:01:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:03,761 INFO L225 Difference]: With dead ends: 139 [2025-01-10 06:01:03,761 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 06:01:03,761 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-01-10 06:01:03,762 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 220 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-01-10 06:01:03,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 220 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 06:01:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-01-10 06:01:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.264957264957265) internal successors, (148), 126 states have internal predecessors, (148), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2025-01-10 06:01:03,774 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 48 [2025-01-10 06:01:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2025-01-10 06:01:03,774 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-01-10 06:01:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2025-01-10 06:01:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:01:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:03,776 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-01-10 06:01:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:01:03,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1246833864, now seen corresponding path program 1 times [2025-01-10 06:01:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875154531] [2025-01-10 06:01:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:03,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:01:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:01:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875154531] [2025-01-10 06:01:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875154531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:04,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:04,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:04,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730637434] [2025-01-10 06:01:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:04,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:04,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:04,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:04,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:04,013 INFO L87 Difference]: Start difference. First operand 136 states and 163 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-01-10 06:01:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:04,026 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2025-01-10 06:01:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:04,027 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-01-10 06:01:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:04,028 INFO L225 Difference]: With dead ends: 136 [2025-01-10 06:01:04,028 INFO L226 Difference]: Without dead ends: 135 [2025-01-10 06:01:04,028 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-01-10 06:01:04,029 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 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-01-10 06:01:04,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-10 06:01:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-01-10 06:01:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 121 states have internal predecessors, (142), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2025-01-10 06:01:04,035 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 49 [2025-01-10 06:01:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:04,035 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2025-01-10 06:01:04,035 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-01-10 06:01:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2025-01-10 06:01:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:01:04,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:04,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:01:04,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2063351008, now seen corresponding path program 1 times [2025-01-10 06:01:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481658113] [2025-01-10 06:01:04,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:04,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:01:04,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:01:04,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481658113] [2025-01-10 06:01:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481658113] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257502995] [2025-01-10 06:01:04,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:04,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:04,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:01:04,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:01:04,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:01:04,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:04,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:04,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:04,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:04,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257502995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 06:01:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418188170] [2025-01-10 06:01:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:04,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:04,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:04,778 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-01-10 06:01:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:04,841 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2025-01-10 06:01:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-01-10 06:01:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:04,843 INFO L225 Difference]: With dead ends: 181 [2025-01-10 06:01:04,843 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 06:01:04,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:04,843 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:04,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 423 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 06:01:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2025-01-10 06:01:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 122 states have internal predecessors, (143), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2025-01-10 06:01:04,850 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 50 [2025-01-10 06:01:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:04,850 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2025-01-10 06:01:04,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-01-10 06:01:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2025-01-10 06:01:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:01:04,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:04,851 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, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:04,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:01:05,051 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-01-10 06:01:05,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:05,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1172696518, now seen corresponding path program 1 times [2025-01-10 06:01:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665284291] [2025-01-10 06:01:05,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:05,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:01:05,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:01:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665284291] [2025-01-10 06:01:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665284291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073891725] [2025-01-10 06:01:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:05,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:05,321 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 06:01:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:05,342 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2025-01-10 06:01:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 55 [2025-01-10 06:01:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:05,343 INFO L225 Difference]: With dead ends: 145 [2025-01-10 06:01:05,344 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 06:01:05,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:05,345 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:05,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 06:01:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-10 06:01:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.25) internal successors, (145), 124 states have internal predecessors, (145), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2025-01-10 06:01:05,352 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 55 [2025-01-10 06:01:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:05,353 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2025-01-10 06:01:05,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 06:01:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2025-01-10 06:01:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:01:05,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:05,354 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-01-10 06:01:05,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:01:05,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:05,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash -988219402, now seen corresponding path program 1 times [2025-01-10 06:01:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147837210] [2025-01-10 06:01:05,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:05,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:01:05,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:01:05,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:05,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147837210] [2025-01-10 06:01:05,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147837210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948298078] [2025-01-10 06:01:05,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:05,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:05,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:05,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:01:05,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:01:06,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:01:06,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:06,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:06,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948298078] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:06,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:06,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016145625] [2025-01-10 06:01:06,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:06,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:06,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:06,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:06,124 INFO L87 Difference]: Start difference. First operand 134 states and 160 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-01-10 06:01:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:06,156 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2025-01-10 06:01:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:06,157 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-01-10 06:01:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:06,158 INFO L225 Difference]: With dead ends: 242 [2025-01-10 06:01:06,158 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 06:01:06,158 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-01-10 06:01:06,158 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:06,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 443 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 06:01:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-10 06:01:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 142 states have internal predecessors, (163), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2025-01-10 06:01:06,164 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 55 [2025-01-10 06:01:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:06,164 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2025-01-10 06:01:06,164 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-01-10 06:01:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2025-01-10 06:01:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 06:01:06,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:06,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:06,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:06,367 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,SelfDestructingSolverStorable13 [2025-01-10 06:01:06,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1988774499, now seen corresponding path program 1 times [2025-01-10 06:01:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108601893] [2025-01-10 06:01:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:06,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 06:01:06,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 06:01:06,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:06,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108601893] [2025-01-10 06:01:06,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108601893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:06,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:06,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:06,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485693963] [2025-01-10 06:01:06,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:06,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:06,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:06,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:06,577 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-01-10 06:01:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:06,592 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2025-01-10 06:01:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 59 [2025-01-10 06:01:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:06,593 INFO L225 Difference]: With dead ends: 165 [2025-01-10 06:01:06,593 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 06:01:06,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:06,594 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:06,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 06:01:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-10 06:01:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.213235294117647) internal successors, (165), 144 states have internal predecessors, (165), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2025-01-10 06:01:06,600 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 59 [2025-01-10 06:01:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2025-01-10 06:01:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-01-10 06:01:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2025-01-10 06:01:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 06:01:06,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:06,601 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:06,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:01:06,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:06,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1918630518, now seen corresponding path program 1 times [2025-01-10 06:01:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429616654] [2025-01-10 06:01:06,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 06:01:06,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 06:01:06,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-10 06:01:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429616654] [2025-01-10 06:01:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429616654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35769813] [2025-01-10 06:01:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:06,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:06,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:06,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:06,909 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:06,948 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2025-01-10 06:01:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-01-10 06:01:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:06,950 INFO L225 Difference]: With dead ends: 167 [2025-01-10 06:01:06,950 INFO L226 Difference]: Without dead ends: 164 [2025-01-10 06:01:06,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:06,951 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 18 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:06,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 447 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-10 06:01:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-01-10 06:01:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 150 states have internal predecessors, (174), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2025-01-10 06:01:06,960 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 61 [2025-01-10 06:01:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:06,961 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2025-01-10 06:01:06,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2025-01-10 06:01:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 06:01:06,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:06,962 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:06,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:01:06,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1918628596, now seen corresponding path program 1 times [2025-01-10 06:01:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623798313] [2025-01-10 06:01:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:07,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 06:01:07,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 06:01:07,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:07,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:01:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623798313] [2025-01-10 06:01:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623798313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000667189] [2025-01-10 06:01:07,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:07,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:07,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:07,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:01:07,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 06:01:08,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 06:01:08,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:08,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:01:08,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:01:08,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000667189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-10 06:01:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450039606] [2025-01-10 06:01:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:08,186 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:08,284 INFO L93 Difference]: Finished difference Result 239 states and 288 transitions. [2025-01-10 06:01:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2025-01-10 06:01:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:08,285 INFO L225 Difference]: With dead ends: 239 [2025-01-10 06:01:08,285 INFO L226 Difference]: Without dead ends: 160 [2025-01-10 06:01:08,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:08,286 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:08,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 387 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-10 06:01:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-10 06:01:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 149 states have internal predecessors, (172), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2025-01-10 06:01:08,299 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 61 [2025-01-10 06:01:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2025-01-10 06:01:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2025-01-10 06:01:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:01:08,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:08,299 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:08,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:01:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:08,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1736574572, now seen corresponding path program 1 times [2025-01-10 06:01:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8879309] [2025-01-10 06:01:08,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:08,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:01:08,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:01:08,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:08,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:01:08,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:08,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8879309] [2025-01-10 06:01:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8879309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:08,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39821817] [2025-01-10 06:01:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:08,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:08,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:01:09,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:01:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:01:09,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:09,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:01:09,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:09,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:01:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39821817] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:09,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:01:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810167504] [2025-01-10 06:01:09,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:01:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:09,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:01:09,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:01:09,375 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-01-10 06:01:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:09,441 INFO L93 Difference]: Finished difference Result 303 states and 367 transitions. [2025-01-10 06:01:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:01:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 66 [2025-01-10 06:01:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:09,442 INFO L225 Difference]: With dead ends: 303 [2025-01-10 06:01:09,442 INFO L226 Difference]: Without dead ends: 195 [2025-01-10 06:01:09,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 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-01-10 06:01:09,443 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:09,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 635 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-10 06:01:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-10 06:01:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 184 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2025-01-10 06:01:09,450 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 66 [2025-01-10 06:01:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2025-01-10 06:01:09,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-01-10 06:01:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2025-01-10 06:01:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 06:01:09,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:09,451 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:09,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:01:09,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:01:09,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:09,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash -813815232, now seen corresponding path program 1 times [2025-01-10 06:01:09,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:09,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729568787] [2025-01-10 06:01:09,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:09,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:01:09,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:01:09,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:09,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729568787] [2025-01-10 06:01:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729568787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108399995] [2025-01-10 06:01:09,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:09,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:09,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:01:10,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:01:10,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:01:10,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:10,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:10,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:10,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:10,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108399995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:10,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:01:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008078173] [2025-01-10 06:01:10,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:10,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:10,518 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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-01-10 06:01:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:10,542 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2025-01-10 06:01:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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 85 [2025-01-10 06:01:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:10,544 INFO L225 Difference]: With dead ends: 205 [2025-01-10 06:01:10,545 INFO L226 Difference]: Without dead ends: 204 [2025-01-10 06:01:10,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-01-10 06:01:10,546 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:10,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-10 06:01:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-10 06:01:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 187 states have (on average 1.1550802139037433) internal successors, (216), 193 states have internal predecessors, (216), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2025-01-10 06:01:10,556 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 85 [2025-01-10 06:01:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:10,556 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2025-01-10 06:01:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 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-01-10 06:01:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2025-01-10 06:01:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 06:01:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:10,557 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:10,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:10,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:10,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1568292192, now seen corresponding path program 1 times [2025-01-10 06:01:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077954821] [2025-01-10 06:01:10,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:10,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 06:01:11,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 06:01:11,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:11,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-01-10 06:01:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077954821] [2025-01-10 06:01:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077954821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785642852] [2025-01-10 06:01:16,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:16,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:16,521 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:01:17,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 06:01:17,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 06:01:17,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:17,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 06:01:17,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:17,438 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:01:17,440 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 19 treesize of output 16 [2025-01-10 06:01:17,692 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:01:17,692 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 19 treesize of output 16 [2025-01-10 06:01:17,718 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:01:17,719 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 19 treesize of output 16 [2025-01-10 06:01:17,743 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:01:17,743 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 19 treesize of output 16 [2025-01-10 06:01:17,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:01:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:18,076 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 17 treesize of output 12 [2025-01-10 06:01:18,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-10 06:01:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-01-10 06:01:18,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785642852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2025-01-10 06:01:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593880021] [2025-01-10 06:01:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:18,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:01:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:18,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:01:18,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:01:18,126 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:22,851 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2025-01-10 06:01:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:01:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-01-10 06:01:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:22,854 INFO L225 Difference]: With dead ends: 242 [2025-01-10 06:01:22,854 INFO L226 Difference]: Without dead ends: 236 [2025-01-10 06:01:22,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:01:22,855 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:22,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 725 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-10 06:01:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-10 06:01:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2025-01-10 06:01:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 187 states have (on average 1.1497326203208555) internal successors, (215), 193 states have internal predecessors, (215), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2025-01-10 06:01:22,864 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 95 [2025-01-10 06:01:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:22,864 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2025-01-10 06:01:22,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2025-01-10 06:01:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 06:01:22,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:22,903 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:22,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:01:23,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:23,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:23,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 30393098, now seen corresponding path program 2 times [2025-01-10 06:01:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:23,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153087836] [2025-01-10 06:01:23,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:23,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-01-10 06:01:23,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 94 statements. [2025-01-10 06:01:23,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153087836] [2025-01-10 06:01:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153087836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764550523] [2025-01-10 06:01:23,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:23,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:23,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:23,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:01:23,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-01-10 06:01:24,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 94 statements. [2025-01-10 06:01:24,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:24,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:24,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:24,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:24,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764550523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:24,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 06:01:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620266632] [2025-01-10 06:01:24,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:24,192 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-01-10 06:01:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:24,250 INFO L93 Difference]: Finished difference Result 204 states and 230 transitions. [2025-01-10 06:01:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 94 [2025-01-10 06:01:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:24,251 INFO L225 Difference]: With dead ends: 204 [2025-01-10 06:01:24,251 INFO L226 Difference]: Without dead ends: 187 [2025-01-10 06:01:24,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:24,253 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 99 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:24,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 352 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-10 06:01:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-01-10 06:01:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 171 states have (on average 1.152046783625731) internal successors, (197), 176 states have internal predecessors, (197), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:01:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2025-01-10 06:01:24,265 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 94 [2025-01-10 06:01:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:24,265 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2025-01-10 06:01:24,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-01-10 06:01:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2025-01-10 06:01:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:01:24,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:24,267 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:24,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 06:01:24,468 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [execvpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, execvpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_perror_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-01-10 06:01:24,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1982319867, now seen corresponding path program 1 times [2025-01-10 06:01:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:24,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444392947] [2025-01-10 06:01:24,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:24,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:01:24,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:01:24,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:24,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-01-10 06:01:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444392947] [2025-01-10 06:01:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444392947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944784399] [2025-01-10 06:01:29,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:29,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:29,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:29,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:29,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:01:29,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:01:30,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:01:30,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:30,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1879 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-10 06:01:30,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:30,119 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-01-10 06:01:30,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 06:01:30,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 06:01:30,156 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:01:30,156 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 19 treesize of output 16 [2025-01-10 06:01:30,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,201 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 122 treesize of output 84 [2025-01-10 06:01:30,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,222 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,222 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 1 case distinctions, treesize of input 68 treesize of output 61 [2025-01-10 06:01:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,230 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 0 case distinctions, treesize of input 36 treesize of output 38 [2025-01-10 06:01:30,234 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 35 treesize of output 20 [2025-01-10 06:01:30,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-01-10 06:01:30,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,258 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 156 treesize of output 110 [2025-01-10 06:01:30,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,275 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 162 treesize of output 116 [2025-01-10 06:01:30,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:01:30,292 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2025-01-10 06:01:30,292 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 79 treesize of output 1 [2025-01-10 06:01:30,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,347 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 52 treesize of output 47 [2025-01-10 06:01:30,352 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 35 treesize of output 20 [2025-01-10 06:01:30,414 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,415 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 52 treesize of output 47 [2025-01-10 06:01:30,426 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 35 treesize of output 20 [2025-01-10 06:01:30,489 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,489 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 52 treesize of output 47 [2025-01-10 06:01:30,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 35 treesize of output 20 [2025-01-10 06:01:30,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,559 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 52 treesize of output 47 [2025-01-10 06:01:30,569 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 35 treesize of output 20 [2025-01-10 06:01:30,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,626 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 52 treesize of output 47 [2025-01-10 06:01:30,633 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 35 treesize of output 20 [2025-01-10 06:01:30,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,681 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 52 treesize of output 47 [2025-01-10 06:01:30,690 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 35 treesize of output 20 [2025-01-10 06:01:30,746 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,746 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 52 treesize of output 47 [2025-01-10 06:01:30,755 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 35 treesize of output 20 [2025-01-10 06:01:30,803 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,803 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 52 treesize of output 47 [2025-01-10 06:01:30,808 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 35 treesize of output 20 [2025-01-10 06:01:30,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,855 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 52 treesize of output 47 [2025-01-10 06:01:30,861 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 35 treesize of output 20 [2025-01-10 06:01:30,904 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:01:30,905 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 52 treesize of output 47 [2025-01-10 06:01:30,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-01-10 06:01:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-10 06:01:31,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:46,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:01:46,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 11801 treesize of output 5204 [2025-01-10 06:01:46,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:01:46,536 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 5166 treesize of output 5172