./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-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/mkfifo-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 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:03:34,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:03:34,293 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:03:34,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:03:34,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:03:34,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:03:34,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:03:34,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:03:34,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:03:34,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:03:34,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:03:34,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:03:34,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:03:34,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:03:34,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:03:34,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:03:34,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:03:34,326 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:03:34,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:34,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:34,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:34,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:03:34,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:03:34,328 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 -> 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b [2025-01-10 06:03:34,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:03:34,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:03:34,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:03:34,639 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:03:34,640 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:03:34,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-01-10 06:03:35,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e1e7206/0cbcfdf3fb3b490287b277649c9bf222/FLAG65159236b [2025-01-10 06:03:36,328 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:03:36,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-01-10 06:03:36,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e1e7206/0cbcfdf3fb3b490287b277649c9bf222/FLAG65159236b [2025-01-10 06:03:36,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75e1e7206/0cbcfdf3fb3b490287b277649c9bf222 [2025-01-10 06:03:36,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:03:36,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:03:36,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:03:36,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:03:36,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:03:36,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:36" (1/1) ... [2025-01-10 06:03:36,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d6927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:36, skipping insertion in model container [2025-01-10 06:03:36,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:36" (1/1) ... [2025-01-10 06:03:36,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:03:37,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:03:37,317 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:03:37,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:03:37,590 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:03:37,599 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:03:37,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37 WrapperNode [2025-01-10 06:03:37,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:03:37,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:03:37,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:03:37,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:03:37,605 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:03:37" (1/1) ... [2025-01-10 06:03:37,631 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:03:37" (1/1) ... [2025-01-10 06:03:37,679 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 790 [2025-01-10 06:03:37,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:03:37,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:03:37,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:03:37,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:03:37,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,727 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:03:37,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:03:37,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:03:37,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:03:37,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:03:37,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (1/1) ... [2025-01-10 06:03:37,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:37,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:37,848 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:03:37,850 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:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:03:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:03:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:03:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:03:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:03:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:03:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:03:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:03:38,180 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:03:38,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:03:38,991 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-01-10 06:03:38,992 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:03:39,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:03:39,007 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 06:03:39,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:03:39 BoogieIcfgContainer [2025-01-10 06:03:39,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:03:39,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:03:39,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:03:39,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:03:39,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:03:36" (1/3) ... [2025-01-10 06:03:39,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e723fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:03:39, skipping insertion in model container [2025-01-10 06:03:39,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:37" (2/3) ... [2025-01-10 06:03:39,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e723fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:03:39, skipping insertion in model container [2025-01-10 06:03:39,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:03:39" (3/3) ... [2025-01-10 06:03:39,018 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-2.i [2025-01-10 06:03:39,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:03:39,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-2.i that has 3 procedures, 162 locations, 1 initial locations, 12 loop locations, and 40 error locations. [2025-01-10 06:03:39,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:03:39,113 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;@131d5efd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:03:39,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 06:03:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 112 states have (on average 1.6785714285714286) internal successors, (188), 152 states have internal predecessors, (188), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 06:03:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:03:39,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:39,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:03:39,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:39,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1602884, now seen corresponding path program 1 times [2025-01-10 06:03:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:39,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916417839] [2025-01-10 06:03:39,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:03:39,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:03:39,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:39,675 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:03:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:39,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916417839] [2025-01-10 06:03:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916417839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:39,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:39,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191076188] [2025-01-10 06:03:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:39,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:39,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:39,705 INFO L87 Difference]: Start difference. First operand has 162 states, 112 states have (on average 1.6785714285714286) internal successors, (188), 152 states have internal predecessors, (188), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:03:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:39,760 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2025-01-10 06:03:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:39,762 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:03:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:39,767 INFO L225 Difference]: With dead ends: 223 [2025-01-10 06:03:39,769 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 06:03:39,773 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:03:39,776 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 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:03:39,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 06:03:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-10 06:03:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.5) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-01-10 06:03:39,820 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 4 [2025-01-10 06:03:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:39,820 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-01-10 06:03:39,820 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:03:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-01-10 06:03:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:03:39,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:39,821 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:03:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:03:39,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 506938428, now seen corresponding path program 1 times [2025-01-10 06:03:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425032720] [2025-01-10 06:03:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:39,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:03:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:03:39,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:39,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:40,085 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:03:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425032720] [2025-01-10 06:03:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425032720] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374901486] [2025-01-10 06:03:40,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:40,090 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:03:40,093 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:03:40,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:03:40,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:03:40,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:40,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:40,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:40,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:40,435 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:03:40,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374901486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:03:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408790596] [2025-01-10 06:03:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:40,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:40,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:40,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:40,438 INFO L87 Difference]: Start difference. First operand 63 states and 75 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:03:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:40,481 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-01-10 06:03:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:40,483 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:03:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:40,484 INFO L225 Difference]: With dead ends: 63 [2025-01-10 06:03:40,484 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 06:03:40,484 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:03:40,485 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 06:03:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 06:03:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-01-10 06:03:40,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 7 [2025-01-10 06:03:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:40,495 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-01-10 06:03:40,495 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:03:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-01-10 06:03:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:03:40,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:40,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:03:40,509 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:03:40,701 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:03:40,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:40,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1464777854, now seen corresponding path program 1 times [2025-01-10 06:03:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55205532] [2025-01-10 06:03:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:40,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:03:40,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:03:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:40,880 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:03:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55205532] [2025-01-10 06:03:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55205532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882885610] [2025-01-10 06:03:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:40,883 INFO L87 Difference]: Start difference. First operand 62 states and 74 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:03:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:40,904 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-01-10 06:03:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:40,905 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:03:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:40,906 INFO L225 Difference]: With dead ends: 62 [2025-01-10 06:03:40,907 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 06:03:40,907 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:03:40,908 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 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:03:40,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 06:03:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-01-10 06:03:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-01-10 06:03:40,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 8 [2025-01-10 06:03:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:40,915 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-01-10 06:03:40,915 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:03:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-01-10 06:03:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:03:40,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:40,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:40,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:03:40,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash -103293580, now seen corresponding path program 1 times [2025-01-10 06:03:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:40,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097456486] [2025-01-10 06:03:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:40,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:03:40,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:03:40,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:40,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:41,127 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:03:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097456486] [2025-01-10 06:03:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097456486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298671824] [2025-01-10 06:03:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:41,130 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:03:41,133 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:03:41,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:03:41,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:03:41,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:41,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:03:41,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:41,411 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:03:41,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298671824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:03:41,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467823062] [2025-01-10 06:03:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:41,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:41,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:41,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:41,415 INFO L87 Difference]: Start difference. First operand 59 states and 71 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:03:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:41,454 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-01-10 06:03:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:41,455 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:03:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:41,460 INFO L225 Difference]: With dead ends: 59 [2025-01-10 06:03:41,460 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 06:03:41,460 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:03:41,461 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 51 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 69 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:03:41,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 69 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 06:03:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 06:03:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-10 06:03:41,472 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 12 [2025-01-10 06:03:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-10 06:03:41,474 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:03:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-10 06:03:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:03:41,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:41,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:41,485 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:03:41,677 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:03:41,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1092866385, now seen corresponding path program 1 times [2025-01-10 06:03:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077246931] [2025-01-10 06:03:41,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:41,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:03:41,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:03:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:41,852 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:03:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077246931] [2025-01-10 06:03:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077246931] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139313920] [2025-01-10 06:03:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:41,858 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:03:41,860 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:03:42,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:03:42,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:03:42,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:42,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:42,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:42,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:42,155 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:03:42,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:42,192 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:03:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139313920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:42,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:03:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452220919] [2025-01-10 06:03:42,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:03:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:42,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:03:42,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:03:42,196 INFO L87 Difference]: Start difference. First operand 57 states and 69 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:03:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:42,238 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2025-01-10 06:03:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:03:42,239 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:03:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:42,240 INFO L225 Difference]: With dead ends: 117 [2025-01-10 06:03:42,240 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 06:03:42,241 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:03:42,243 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 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:03:42,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 06:03:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 06:03:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2025-01-10 06:03:42,255 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2025-01-10 06:03:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2025-01-10 06:03:42,255 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:03:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2025-01-10 06:03:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:03:42,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:42,256 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:42,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:03:42,456 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:03:42,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1278531161, now seen corresponding path program 2 times [2025-01-10 06:03:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262769443] [2025-01-10 06:03:42,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:42,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:03:42,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:03:42,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:03:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:42,755 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:03:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262769443] [2025-01-10 06:03:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262769443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:03:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508670775] [2025-01-10 06:03:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:03:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:42,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:03:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:42,758 INFO L87 Difference]: Start difference. First operand 66 states and 78 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:03:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:42,813 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-01-10 06:03:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:42,813 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:03:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:42,814 INFO L225 Difference]: With dead ends: 66 [2025-01-10 06:03:42,814 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 06:03:42,814 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:03:42,815 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:42,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 165 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 06:03:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 06:03:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.320754716981132) internal successors, (70), 59 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-01-10 06:03:42,827 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2025-01-10 06:03:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:42,827 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-01-10 06:03:42,827 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:03:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2025-01-10 06:03:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:03:42,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:42,828 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:03:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:03:42,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:42,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -45410220, now seen corresponding path program 1 times [2025-01-10 06:03:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593516904] [2025-01-10 06:03:42,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:42,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:03:42,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:03:42,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:42,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:43,027 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:03:43,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593516904] [2025-01-10 06:03:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593516904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:43,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921458664] [2025-01-10 06:03:43,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:43,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:43,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:43,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:43,029 INFO L87 Difference]: Start difference. First operand 64 states and 76 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:03:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:43,052 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2025-01-10 06:03:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:43,052 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:03:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:43,053 INFO L225 Difference]: With dead ends: 111 [2025-01-10 06:03:43,053 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 06:03:43,053 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:03:43,054 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 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:03:43,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 06:03:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 06:03:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-01-10 06:03:43,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2025-01-10 06:03:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-01-10 06:03:43,060 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:03:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-01-10 06:03:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:03:43,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:43,061 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:03:43,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:03:43,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 98918499, now seen corresponding path program 1 times [2025-01-10 06:03:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416052669] [2025-01-10 06:03:43,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:43,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:03:43,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:03:43,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:43,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:43,357 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:03:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416052669] [2025-01-10 06:03:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416052669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229154256] [2025-01-10 06:03:43,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:43,362 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:03:43,364 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:03:43,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:03:43,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:03:43,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:43,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:03:43,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:43,757 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:03:43,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:43,863 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:03:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229154256] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:03:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932309053] [2025-01-10 06:03:43,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:03:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:03:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:03:43,866 INFO L87 Difference]: Start difference. First operand 67 states and 79 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:03:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:43,986 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-01-10 06:03:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:03:43,987 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:03:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:43,988 INFO L225 Difference]: With dead ends: 136 [2025-01-10 06:03:43,988 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 06:03:43,990 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:03:43,990 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:43,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 442 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 06:03:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-10 06:03:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2025-01-10 06:03:44,005 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 30 [2025-01-10 06:03:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:44,005 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-01-10 06:03:44,005 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:03:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2025-01-10 06:03:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:03:44,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:44,006 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:03:44,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:03:44,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:03:44,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:44,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash 614160419, now seen corresponding path program 1 times [2025-01-10 06:03:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:44,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82785511] [2025-01-10 06:03:44,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:44,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:03:44,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:03:44,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:44,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:03:44,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:44,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82785511] [2025-01-10 06:03:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82785511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:44,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:44,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176110893] [2025-01-10 06:03:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:44,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:44,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:44,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:44,437 INFO L87 Difference]: Start difference. First operand 84 states and 96 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:03:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:44,468 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-01-10 06:03:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:44,469 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:03:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:44,470 INFO L225 Difference]: With dead ends: 96 [2025-01-10 06:03:44,470 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 06:03:44,471 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:03:44,471 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 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:03:44,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 06:03:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-10 06:03:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 88 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2025-01-10 06:03:44,485 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 48 [2025-01-10 06:03:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2025-01-10 06:03:44,485 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:03:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2025-01-10 06:03:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:03:44,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:44,486 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:03:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:03:44,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:44,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:44,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1859097938, now seen corresponding path program 1 times [2025-01-10 06:03:44,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994120390] [2025-01-10 06:03:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:44,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:03:44,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:03:44,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:44,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:44,687 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:03:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994120390] [2025-01-10 06:03:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994120390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:44,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853767348] [2025-01-10 06:03:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:44,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:44,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:44,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:44,689 INFO L87 Difference]: Start difference. First operand 93 states and 108 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:03:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:44,707 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-01-10 06:03:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:44,707 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:03:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:44,708 INFO L225 Difference]: With dead ends: 93 [2025-01-10 06:03:44,708 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 06:03:44,709 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:03:44,709 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 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:03:44,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 06:03:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-01-10 06:03:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 83 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2025-01-10 06:03:44,722 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 49 [2025-01-10 06:03:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:44,725 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2025-01-10 06:03:44,726 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:03:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2025-01-10 06:03:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 06:03:44,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:44,727 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] [2025-01-10 06:03:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:03:44,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 824057492, now seen corresponding path program 1 times [2025-01-10 06:03:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960525987] [2025-01-10 06:03:44,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:44,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 06:03:44,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 06:03:44,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:44,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:44,937 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:03:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960525987] [2025-01-10 06:03:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960525987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:03:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414831129] [2025-01-10 06:03:44,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:03:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:44,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:03:44,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:03:44,939 INFO L87 Difference]: Start difference. First operand 88 states and 102 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:44,965 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-01-10 06:03:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:03:44,965 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-01-10 06:03:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:44,966 INFO L225 Difference]: With dead ends: 93 [2025-01-10 06:03:44,968 INFO L226 Difference]: Without dead ends: 91 [2025-01-10 06:03:44,968 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:03:44,968 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 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:03:44,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-10 06:03:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-10 06:03:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 86 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-01-10 06:03:44,981 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 53 [2025-01-10 06:03:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-01-10 06:03:44,982 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-01-10 06:03:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 06:03:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:44,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:03:44,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash -535950494, now seen corresponding path program 1 times [2025-01-10 06:03:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769289816] [2025-01-10 06:03:44,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:45,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 06:03:45,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 06:03:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-10 06:03:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769289816] [2025-01-10 06:03:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769289816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029849198] [2025-01-10 06:03:45,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:45,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:45,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:45,254 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:03:45,256 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:03:45,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 06:03:45,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 06:03:45,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:45,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:45,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:03:45,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-10 06:03:45,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029849198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 06:03:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083527165] [2025-01-10 06:03:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:03:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:03:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:03:45,612 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:03:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:45,664 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2025-01-10 06:03:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:03:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2025-01-10 06:03:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:45,665 INFO L225 Difference]: With dead ends: 124 [2025-01-10 06:03:45,666 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 06:03:45,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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:03:45,666 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:45,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 195 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 06:03:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2025-01-10 06:03:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 103 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:03:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2025-01-10 06:03:45,674 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 56 [2025-01-10 06:03:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:45,674 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2025-01-10 06:03:45,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:03:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2025-01-10 06:03:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:03:45,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:45,675 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:03:45,686 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:03:45,876 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:03:45,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2014541568, now seen corresponding path program 1 times [2025-01-10 06:03:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482017477] [2025-01-10 06:03:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:45,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:03:45,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:03:45,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:45,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:46,138 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:03:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482017477] [2025-01-10 06:03:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482017477] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117183778] [2025-01-10 06:03:46,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:46,142 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:03:46,145 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:03:46,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:03:46,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:03:46,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:46,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:46,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:46,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:46,536 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:03:46,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:46,567 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:03:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117183778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:46,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:46,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:03:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228497825] [2025-01-10 06:03:46,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:03:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:46,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:03:46,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:03:46,569 INFO L87 Difference]: Start difference. First operand 110 states and 131 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:03:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:46,607 INFO L93 Difference]: Finished difference Result 176 states and 213 transitions. [2025-01-10 06:03:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:03:46,607 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:03:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:46,608 INFO L225 Difference]: With dead ends: 176 [2025-01-10 06:03:46,608 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 06:03:46,609 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:03:46,609 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:46,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 177 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 06:03:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-10 06:03:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.188034188034188) internal successors, (139), 121 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:03:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2025-01-10 06:03:46,626 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 55 [2025-01-10 06:03:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2025-01-10 06:03:46,626 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:03:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2025-01-10 06:03:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 06:03:46,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:46,627 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] [2025-01-10 06:03:46,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:03:46,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:03:46,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 707372912, now seen corresponding path program 1 times [2025-01-10 06:03:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:46,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411141655] [2025-01-10 06:03:46,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 06:03:46,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 06:03:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:47,067 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:03:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411141655] [2025-01-10 06:03:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411141655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:47,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:03:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679989313] [2025-01-10 06:03:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:47,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:47,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:47,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:47,069 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:47,098 INFO L93 Difference]: Finished difference Result 182 states and 217 transitions. [2025-01-10 06:03:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2025-01-10 06:03:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:47,100 INFO L225 Difference]: With dead ends: 182 [2025-01-10 06:03:47,100 INFO L226 Difference]: Without dead ends: 132 [2025-01-10 06:03:47,100 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:03:47,101 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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:03:47,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-10 06:03:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-10 06:03:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 125 states have internal predecessors, (143), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:03:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-01-10 06:03:47,113 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 60 [2025-01-10 06:03:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:47,114 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-01-10 06:03:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2025-01-10 06:03:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:03:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:47,115 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:03:47,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -107165380, now seen corresponding path program 1 times [2025-01-10 06:03:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116716825] [2025-01-10 06:03:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:47,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:03:47,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:03:47,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:47,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-10 06:03:47,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116716825] [2025-01-10 06:03:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116716825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:47,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:47,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:03:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009472008] [2025-01-10 06:03:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:47,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:47,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:47,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:47,410 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 06:03:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:47,423 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2025-01-10 06:03:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2025-01-10 06:03:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:47,425 INFO L225 Difference]: With dead ends: 135 [2025-01-10 06:03:47,425 INFO L226 Difference]: Without dead ends: 132 [2025-01-10 06:03:47,425 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:03:47,426 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 169 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-10 06:03:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-10 06:03:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1735537190082646) internal successors, (142), 125 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:03:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2025-01-10 06:03:47,437 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 66 [2025-01-10 06:03:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2025-01-10 06:03:47,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 06:03:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2025-01-10 06:03:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:03:47,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:47,438 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:03:47,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -107163458, now seen corresponding path program 1 times [2025-01-10 06:03:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4696996] [2025-01-10 06:03:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:47,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:03:47,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:03:47,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:47,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-10 06:03:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4696996] [2025-01-10 06:03:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4696996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:49,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:03:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 06:03:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894659574] [2025-01-10 06:03:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:49,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:03:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:49,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:03:49,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:03:49,240 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:49,716 INFO L93 Difference]: Finished difference Result 194 states and 228 transitions. [2025-01-10 06:03:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:03:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2025-01-10 06:03:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:49,719 INFO L225 Difference]: With dead ends: 194 [2025-01-10 06:03:49,719 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 06:03:49,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:03:49,720 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 130 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:49,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 262 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:03:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 06:03:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2025-01-10 06:03:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 114 states have internal predecessors, (126), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:03:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2025-01-10 06:03:49,733 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 66 [2025-01-10 06:03:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:49,733 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2025-01-10 06:03:49,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2025-01-10 06:03:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 06:03:49,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:49,734 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:49,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:03:49,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1482462301, now seen corresponding path program 1 times [2025-01-10 06:03:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:49,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080980009] [2025-01-10 06:03:49,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 06:03:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 06:03:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-10 06:03:50,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080980009] [2025-01-10 06:03:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080980009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468180031] [2025-01-10 06:03:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:50,175 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:03:50,178 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:03:50,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 06:03:50,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 06:03:50,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:50,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:03:50,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:03:50,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468180031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-10 06:03:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304601907] [2025-01-10 06:03:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:03:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:50,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:03:50,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:03:50,663 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:50,743 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2025-01-10 06:03:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:03:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2025-01-10 06:03:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:50,745 INFO L225 Difference]: With dead ends: 134 [2025-01-10 06:03:50,745 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 06:03:50,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:03:50,747 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:50,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 231 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 06:03:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-10 06:03:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2025-01-10 06:03:50,762 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 68 [2025-01-10 06:03:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:50,762 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2025-01-10 06:03:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2025-01-10 06:03:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 06:03:50,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:50,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:50,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:03:50,966 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:03:50,966 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:50,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -477937682, now seen corresponding path program 1 times [2025-01-10 06:03:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928544689] [2025-01-10 06:03:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:50,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:51,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:03:51,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:03:51,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:51,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-10 06:03:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928544689] [2025-01-10 06:03:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928544689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015667329] [2025-01-10 06:03:51,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:51,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:51,189 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:03:51,191 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:03:51,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 06:03:51,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 06:03:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:51,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:03:51,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:03:51,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-10 06:03:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015667329] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:51,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:03:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336046606] [2025-01-10 06:03:51,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:03:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:03:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:03:51,752 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:03:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:51,854 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2025-01-10 06:03:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:03:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2025-01-10 06:03:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:51,855 INFO L225 Difference]: With dead ends: 199 [2025-01-10 06:03:51,855 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 06:03:51,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 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:03:51,856 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 287 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:03:51,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 287 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 06:03:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-10 06:03:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 135 states have (on average 1.0888888888888888) internal successors, (147), 138 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2025-01-10 06:03:51,871 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 72 [2025-01-10 06:03:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:51,871 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2025-01-10 06:03:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:03:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2025-01-10 06:03:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 06:03:51,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:51,873 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:51,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:03:52,073 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:03:52,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2014755878, now seen corresponding path program 1 times [2025-01-10 06:03:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682595565] [2025-01-10 06:03:52,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:52,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 06:03:52,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 06:03:52,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:52,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682595565] [2025-01-10 06:03:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682595565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000681469] [2025-01-10 06:03:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:52,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:52,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:52,312 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:03:52,314 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:03:52,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 06:03:52,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 06:03:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:52,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:52,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:52,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:03:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000681469] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:52,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:03:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193686915] [2025-01-10 06:03:52,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:52,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:03:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:52,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:03:52,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:03:52,857 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:52,896 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-01-10 06:03:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:03:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-01-10 06:03:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:52,898 INFO L225 Difference]: With dead ends: 153 [2025-01-10 06:03:52,898 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 06:03:52,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 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:03:52,899 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:52,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 06:03:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-10 06:03:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 147 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2025-01-10 06:03:52,916 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 91 [2025-01-10 06:03:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:52,917 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2025-01-10 06:03:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2025-01-10 06:03:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 06:03:52,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:52,918 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:52,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:03:53,118 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:03:53,119 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash 537403276, now seen corresponding path program 2 times [2025-01-10 06:03:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215771341] [2025-01-10 06:03:53,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:53,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-10 06:03:53,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 100 statements. [2025-01-10 06:03:53,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:03:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-10 06:03:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215771341] [2025-01-10 06:03:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215771341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280813766] [2025-01-10 06:03:53,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:53,259 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:03:53,261 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:03:53,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-10 06:03:53,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 100 statements. [2025-01-10 06:03:53,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:03:53,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:53,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:53,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-10 06:03:53,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-10 06:03:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280813766] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:53,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:03:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478555018] [2025-01-10 06:03:53,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:53,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:03:53,870 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:53,912 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2025-01-10 06:03:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-10 06:03:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:53,913 INFO L225 Difference]: With dead ends: 152 [2025-01-10 06:03:53,913 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 06:03:53,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 1 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:03:53,916 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:53,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 06:03:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-10 06:03:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 129 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2025-01-10 06:03:53,928 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 100 [2025-01-10 06:03:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2025-01-10 06:03:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:03:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2025-01-10 06:03:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:03:53,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:53,930 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:53,942 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:03:54,131 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:03:54,131 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1493473969, now seen corresponding path program 1 times [2025-01-10 06:03:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389062242] [2025-01-10 06:03:54,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:54,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:03:54,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:03:54,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:54,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-10 06:03:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389062242] [2025-01-10 06:03:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389062242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559611861] [2025-01-10 06:03:54,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:03:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:54,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:54,973 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:03:54,975 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:03:55,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:03:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:03:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:03:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:55,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:03:55,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:03:55,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:03:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-10 06:03:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559611861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:03:55,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:03:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-10 06:03:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943791256] [2025-01-10 06:03:55,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:03:55,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:03:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:55,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:03:55,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:03:55,723 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 06:03:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:55,816 INFO L93 Difference]: Finished difference Result 195 states and 209 transitions. [2025-01-10 06:03:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:03:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 102 [2025-01-10 06:03:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:55,817 INFO L225 Difference]: With dead ends: 195 [2025-01-10 06:03:55,817 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 06:03:55,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:03:55,818 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:55,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 219 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:03:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 06:03:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-10 06:03:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 161 states have (on average 1.0683229813664596) internal successors, (172), 163 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2025-01-10 06:03:55,837 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 102 [2025-01-10 06:03:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:55,838 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2025-01-10 06:03:55,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 06:03:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2025-01-10 06:03:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:03:55,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:55,839 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:55,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 06:03:56,039 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:03:56,039 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -752699640, now seen corresponding path program 2 times [2025-01-10 06:03:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824217129] [2025-01-10 06:03:56,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:56,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-10 06:03:56,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:03:56,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:03:56,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:03:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:03:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824217129] [2025-01-10 06:03:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824217129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:03:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828026074] [2025-01-10 06:03:56,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:56,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:56,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:56,384 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:03:56,386 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:03:56,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-10 06:03:57,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:03:57,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:03:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:03:57,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:03:57,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:03:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:03:57,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:03:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828026074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:03:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:03:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:03:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279637829] [2025-01-10 06:03:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:03:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:03:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:03:57,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:03:57,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:03:57,232 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:03:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:03:57,277 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2025-01-10 06:03:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:03:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 109 [2025-01-10 06:03:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:03:57,279 INFO L225 Difference]: With dead ends: 168 [2025-01-10 06:03:57,279 INFO L226 Difference]: Without dead ends: 167 [2025-01-10 06:03:57,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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:03:57,280 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:03:57,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:03:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-10 06:03:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-10 06:03:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 161 states have (on average 1.0559006211180124) internal successors, (170), 162 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:03:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2025-01-10 06:03:57,304 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 109 [2025-01-10 06:03:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:03:57,304 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2025-01-10 06:03:57,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:03:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2025-01-10 06:03:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 06:03:57,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:03:57,305 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:03:57,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 06:03:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:03:57,512 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:03:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:03:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash -55184389, now seen corresponding path program 2 times [2025-01-10 06:03:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:03:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109733033] [2025-01-10 06:03:57,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:03:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:03:57,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-01-10 06:03:58,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 06:03:58,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:03:58,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:03:58,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:03:58,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 06:04:00,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 06:04:00,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:00,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:04:00,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:04:00,847 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:04:00,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (39 of 40 remaining) [2025-01-10 06:04:00,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 40 remaining) [2025-01-10 06:04:00,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2025-01-10 06:04:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2025-01-10 06:04:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONUNSUPPORTED_FEATURE (4 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2025-01-10 06:04:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2025-01-10 06:04:00,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:04:00,858 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:00,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:04:00,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:04:00 BoogieIcfgContainer [2025-01-10 06:04:00,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:04:00,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:04:00,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:04:00,989 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:04:00,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:03:39" (3/4) ... [2025-01-10 06:04:00,992 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:04:00,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:04:00,993 INFO L158 Benchmark]: Toolchain (without parser) took 24471.62ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 108.6MB in the beginning and 434.5MB in the end (delta: -325.9MB). Peak memory consumption was 310.4MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,993 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:04:00,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1077.31ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 96.5MB in the end (delta: 11.7MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.95ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 89.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,994 INFO L158 Benchmark]: Boogie Preprocessor took 123.68ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 82.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,994 INFO L158 Benchmark]: RCFGBuilder took 1203.40ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 69.3MB in the end (delta: 13.0MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,994 INFO L158 Benchmark]: TraceAbstraction took 21978.49ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 68.5MB in the beginning and 434.6MB in the end (delta: -366.1MB). Peak memory consumption was 294.0MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,994 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 771.8MB. Free memory was 434.6MB in the beginning and 434.5MB in the end (delta: 47.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:04:00,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1077.31ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 96.5MB in the end (delta: 11.7MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.95ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 89.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.68ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 82.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.40ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 69.3MB in the end (delta: 13.0MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21978.49ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 68.5MB in the beginning and 434.6MB in the end (delta: -366.1MB). Peak memory consumption was 294.0MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 771.8MB. Free memory was 434.6MB in the beginning and 434.5MB in the end (delta: 47.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 382]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of undefined function vasprintf at line 382. Possible FailurePath: [L1886] static const char *applet_name; [L1887] static signed int bb_errno_location; [L1888] static signed int * const bb_errno = &bb_errno_location; [L1889] static signed char logmode = (signed char)1; [L1890] static const char *msg_eol = "\n"; [L2069] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}] [L2132] char *a = malloc(11); [L2133] a[10] = 0 [L2134] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}] [L2134] COND TRUE i<10 [L2135] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}] [L2134] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}] [L2134] COND FALSE !(i<10) [L2136] applet_name = a [L2137] bb_errno_location = __VERIFIER_nondet_int() [L2138] optind = 1 [L2139] int argc = __VERIFIER_nondet_int(); [L2140] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2140] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2141] EXPR argc+1 [L2141] char **argv=malloc((argc+1)*sizeof(char*)); [L2142] EXPR argc+1 [L2142] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2143] argv[argc]=0 [L2144] int i=0; VAL [applet_name={-1:0}, argc=2, argv={331:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-13:0}, msg_eol={3:0}, optind=1] [L2144] COND TRUE i 0 && optind < argc) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2026] RET assume_abort_if_not(optind > 0 && optind < argc) VAL [applet_name={-1:0}, argc=2, argv={331:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, retval=0] [L2027] argv = argv + (signed long int)optind [L2028] EXPR \read(**argv) VAL [applet_name={-1:0}, argc=2, argv={331:8}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, retval=0] [L2028] COND FALSE !(*argv == ((char *)((void *)0))) [L2032] signed int return_value_mkfifo$1; [L2033] EXPR \read(**argv) [L2033] CALL, EXPR mkfifo(*argv, mode) [L2061] \read(*file) [L2062] COND TRUE __VERIFIER_nondet_int() [L2063] *bb_errno = __VERIFIER_nondet_int() [L2064] EXPR \read(*bb_errno) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2064] CALL assume_abort_if_not(*bb_errno != 0) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2064] RET assume_abort_if_not(*bb_errno != 0) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2065] return -1; VAL [\result=-1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1] [L2033] RET, EXPR mkfifo(*argv, mode) [L2033] return_value_mkfifo$1=mkfifo(*argv, mode) [L2034] COND TRUE return_value_mkfifo$1 < 0 [L2036] EXPR \read(**argv) [L2036] CALL bb_simple_perror_msg(*argv) [L1913] CALL bb_perror_msg("%s", s) [L1893] va_list p; [L1895] char *tmp_if_expr$2; [L1896] char *return_value_strerror$1; [L1897] EXPR \read(*bb_errno) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}] [L1897] COND TRUE !(*bb_errno == 0) [L1899] return_value_strerror$1=strerror(*bb_errno) [L1900] tmp_if_expr$2 = return_value_strerror$1 VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, tmp_if_expr$2={0:0}] [L1904] CALL bb_verror_msg(s, p, tmp_if_expr$2) [L1917] char *msg; [L1918] char *msg1; [L1919] signed int applet_len; [L1920] signed int strerr_len; [L1921] signed int msgeol_len; [L1922] signed int used; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1923] COND FALSE !((signed int)logmode == 0) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1925] COND FALSE !(s == ((const char *)((void *)0))) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, dummy_utmp={8:0}, logmode=1, msg={333:0}, msg_eol={3:0}, optind=1, p={-37:0}, s={4:0}, strerr={0:0}] [L1927] CALL vasprintf(&msg, s, p) - UnprovableResult [Line: 2134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1947]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1955]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1955]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1965]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1965]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1966]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1972]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1972]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1975]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1975]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1979]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1979]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1982]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1982]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1996]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 2012]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2012]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2153]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2153]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 162 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 23, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 3920 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2665 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 1255 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1254 GetRequests, 1147 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=21, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1969 NumberOfCodeBlocks, 1785 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2255 ConstructedInterpolants, 0 QuantifiedInterpolants, 4781 SizeOfPredicates, 12 NumberOfNonLiveVariables, 14128 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 41 InterpolantComputations, 15 PerfectInterpolantSequences, 6457/6931 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 06:04:01,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/mkfifo-incomplete-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:04:03,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:04:03,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-01-10 06:04:03,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:04:03,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:04:03,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-01-10 06:04:03,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:04:03,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:04:03,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:04:03,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:04:03,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:04:03,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:04:03,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:04:03,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:04:03,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:04:03,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:04:03,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:04:03,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:03,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:04:03,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:03,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:04:03,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:04:03,796 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 -> 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b [2025-01-10 06:04:04,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:04:04,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:04:04,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:04:04,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:04:04,154 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:04:04,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-01-10 06:04:05,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44f669d98/0873dc0969dc48f18d5d7631a32394bc/FLAG8421b938f [2025-01-10 06:04:06,032 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:04:06,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-01-10 06:04:06,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44f669d98/0873dc0969dc48f18d5d7631a32394bc/FLAG8421b938f [2025-01-10 06:04:06,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44f669d98/0873dc0969dc48f18d5d7631a32394bc [2025-01-10 06:04:06,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:04:06,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:04:06,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:06,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:04:06,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:04:06,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:06" (1/1) ... [2025-01-10 06:04:06,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571d3677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:06, skipping insertion in model container [2025-01-10 06:04:06,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:06" (1/1) ... [2025-01-10 06:04:06,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:04:06,853 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,857 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,859 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,860 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,867 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,869 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,869 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,873 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,876 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,877 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,891 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,894 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,902 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,921 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:06,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:06,978 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:04:07,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:07,303 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:04:07,311 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:04:07,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07 WrapperNode [2025-01-10 06:04:07,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:07,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:07,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:04:07,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:04:07,322 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:04:07" (1/1) ... [2025-01-10 06:04:07,363 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:04:07" (1/1) ... [2025-01-10 06:04:07,433 INFO L138 Inliner]: procedures = 585, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 767 [2025-01-10 06:04:07,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:07,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:04:07,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:04:07,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:04:07,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,482 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:04:07,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:04:07,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:04:07,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:04:07,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:04:07,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (1/1) ... [2025-01-10 06:04:07,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:07,624 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:04:07,626 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:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:04:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:04:07,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:04:07,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:04:07,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-01-10 06:04:07,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-01-10 06:04:07,961 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:04:07,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:09,228 INFO L? ?]: Removed 225 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:09,229 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:09,241 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:09,241 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 06:04:09,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:09 BoogieIcfgContainer [2025-01-10 06:04:09,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:09,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:09,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:09,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:09,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:04:06" (1/3) ... [2025-01-10 06:04:09,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f005082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:09, skipping insertion in model container [2025-01-10 06:04:09,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:07" (2/3) ... [2025-01-10 06:04:09,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f005082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:09, skipping insertion in model container [2025-01-10 06:04:09,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:09" (3/3) ... [2025-01-10 06:04:09,252 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-2.i [2025-01-10 06:04:09,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:09,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-2.i that has 3 procedures, 159 locations, 1 initial locations, 12 loop locations, and 40 error locations. [2025-01-10 06:04:09,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:09,346 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;@d2939b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:09,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 06:04:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 109 states have (on average 1.6788990825688073) internal successors, (183), 149 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 06:04:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:09,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:09,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:09,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:09,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1602884, now seen corresponding path program 1 times [2025-01-10 06:04:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765349185] [2025-01-10 06:04:09,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:09,387 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:04:09,389 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:04:09,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:10,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:10,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 06:04:10,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:10,209 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:04:10,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:10,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765349185] [2025-01-10 06:04:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765349185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:10,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:04:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156128732] [2025-01-10 06:04:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:04:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:10,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:04:10,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:04:10,235 INFO L87 Difference]: Start difference. First operand has 159 states, 109 states have (on average 1.6788990825688073) internal successors, (183), 149 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:04:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,256 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2025-01-10 06:04:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:04:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:04:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,264 INFO L225 Difference]: With dead ends: 209 [2025-01-10 06:04:10,264 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 06:04:10,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:04:10,273 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:10,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 06:04:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-10 06:04:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 49 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-01-10 06:04:10,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 4 [2025-01-10 06:04:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,311 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-01-10 06:04:10,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:04:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-01-10 06:04:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:04:10,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:04:10,346 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:04:10,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:10,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:10,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 49689466, now seen corresponding path program 1 times [2025-01-10 06:04:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549654932] [2025-01-10 06:04:10,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:10,520 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:04:10,521 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:04:10,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:04:11,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:04:11,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:11,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:11,234 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:04:11,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:11,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549654932] [2025-01-10 06:04:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549654932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043349910] [2025-01-10 06:04:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:11,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:11,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,237 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:04:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:11,294 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2025-01-10 06:04:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 06:04:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:11,298 INFO L225 Difference]: With dead ends: 106 [2025-01-10 06:04:11,298 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 06:04:11,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:11,299 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:11,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 06:04:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 06:04:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-10 06:04:11,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 5 [2025-01-10 06:04:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:11,313 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-10 06:04:11,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:04:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-10 06:04:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:11,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:11,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:11,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:04:11,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:11,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1464777854, now seen corresponding path program 1 times [2025-01-10 06:04:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3270708] [2025-01-10 06:04:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:11,521 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:04:11,527 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:04:11,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:12,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:12,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:12,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:12,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:12,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:12,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:12,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3270708] [2025-01-10 06:04:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3270708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:12,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:04:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873492397] [2025-01-10 06:04:12,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:12,341 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:04:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:12,442 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2025-01-10 06:04:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:04:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:12,446 INFO L225 Difference]: With dead ends: 109 [2025-01-10 06:04:12,446 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 06:04:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:12,447 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:12,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 06:04:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2025-01-10 06:04:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-01-10 06:04:12,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 8 [2025-01-10 06:04:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:12,459 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-01-10 06:04:12,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:04:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-01-10 06:04:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 06:04:12,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:12,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:12,493 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:04:12,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:12,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1780966721, now seen corresponding path program 1 times [2025-01-10 06:04:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654706569] [2025-01-10 06:04:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:12,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:12,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:12,665 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:04:12,666 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:04:12,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:04:13,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:04:13,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:13,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:13,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:13,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:04:13,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:13,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654706569] [2025-01-10 06:04:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654706569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463741002] [2025-01-10 06:04:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:13,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:13,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:13,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:13,393 INFO L87 Difference]: Start difference. First operand 57 states and 69 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:04:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:13,551 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-01-10 06:04:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:13,552 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 16 [2025-01-10 06:04:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:13,553 INFO L225 Difference]: With dead ends: 57 [2025-01-10 06:04:13,553 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 06:04:13,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:04:13,554 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:13,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 06:04:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-10 06:04:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-01-10 06:04:13,560 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 16 [2025-01-10 06:04:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-01-10 06:04:13,561 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:04:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-01-10 06:04:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:13,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:13,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:13,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:13,767 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 [2025-01-10 06:04:13,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1307724951, now seen corresponding path program 1 times [2025-01-10 06:04:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733418764] [2025-01-10 06:04:13,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:13,771 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:04:13,772 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:04:13,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:04:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:04:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:14,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:04:14,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:14,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:14,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733418764] [2025-01-10 06:04:14,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733418764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:14,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436038510] [2025-01-10 06:04:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:14,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:14,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:14,496 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:04:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,541 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2025-01-10 06:04:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:04:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,544 INFO L225 Difference]: With dead ends: 99 [2025-01-10 06:04:14,544 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 06:04:14,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:04:14,545 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 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:04:14,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 06:04:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-10 06:04:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-01-10 06:04:14,555 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 22 [2025-01-10 06:04:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,556 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-01-10 06:04:14,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:04:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-01-10 06:04:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 06:04:14,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:14,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:14,759 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 [2025-01-10 06:04:14,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:14,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1214407274, now seen corresponding path program 1 times [2025-01-10 06:04:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515264281] [2025-01-10 06:04:14,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:14,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:14,762 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:04:14,763 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:04:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:04:15,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:04:15,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:15,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:04:15,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:04:15,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515264281] [2025-01-10 06:04:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515264281] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:15,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:04:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842846917] [2025-01-10 06:04:15,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:15,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:15,605 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:04:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:15,708 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2025-01-10 06:04:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-01-10 06:04:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:15,710 INFO L225 Difference]: With dead ends: 105 [2025-01-10 06:04:15,710 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 06:04:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:15,711 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:15,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 06:04:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2025-01-10 06:04:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 53 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-01-10 06:04:15,717 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 25 [2025-01-10 06:04:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:15,717 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-01-10 06:04:15,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:04:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-01-10 06:04:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 06:04:15,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:15,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:15,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:04:15,919 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 [2025-01-10 06:04:15,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:15,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1897651983, now seen corresponding path program 1 times [2025-01-10 06:04:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638908167] [2025-01-10 06:04:15,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:15,925 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:04:15,926 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:04:16,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:04:16,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:04:16,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:16,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:04:16,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:16,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638908167] [2025-01-10 06:04:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638908167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994630599] [2025-01-10 06:04:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:16,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:16,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:16,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:16,682 INFO L87 Difference]: Start difference. First operand 58 states and 70 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:04:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:16,854 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-01-10 06:04:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:16,855 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 28 [2025-01-10 06:04:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:16,856 INFO L225 Difference]: With dead ends: 69 [2025-01-10 06:04:16,856 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 06:04:16,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:04:16,858 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:16,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 06:04:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 06:04:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-01-10 06:04:16,871 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 28 [2025-01-10 06:04:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:16,872 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-01-10 06:04:16,872 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:04:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-01-10 06:04:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:16,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:16,911 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:04:17,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:17,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -919172048, now seen corresponding path program 1 times [2025-01-10 06:04:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604192329] [2025-01-10 06:04:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:17,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:17,080 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:04:17,082 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:04:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:17,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:17,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:17,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:17,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:17,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604192329] [2025-01-10 06:04:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604192329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843824463] [2025-01-10 06:04:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:17,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:17,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,732 INFO L87 Difference]: Start difference. First operand 68 states and 82 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,751 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-01-10 06:04:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:17,752 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 06:04:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,752 INFO L225 Difference]: With dead ends: 72 [2025-01-10 06:04:17,752 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 06:04:17,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:04:17,753 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:17,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 06:04:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-10 06:04:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.234375) internal successors, (79), 66 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-01-10 06:04:17,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 30 [2025-01-10 06:04:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-01-10 06:04:17,761 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-01-10 06:04:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 06:04:17,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:17,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:17,962 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 [2025-01-10 06:04:17,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1657350902, now seen corresponding path program 1 times [2025-01-10 06:04:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847277000] [2025-01-10 06:04:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:17,966 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:04:17,967 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:04:18,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:04:18,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:04:18,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:18,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:18,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:18,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847277000] [2025-01-10 06:04:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847277000] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:18,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:04:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890177882] [2025-01-10 06:04:18,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:18,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:18,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:18,689 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:18,751 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2025-01-10 06:04:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-01-10 06:04:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:18,752 INFO L225 Difference]: With dead ends: 78 [2025-01-10 06:04:18,752 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 06:04:18,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:18,753 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:18,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 06:04:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 06:04:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-01-10 06:04:18,759 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 33 [2025-01-10 06:04:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:18,760 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-01-10 06:04:18,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-01-10 06:04:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 06:04:18,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:18,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:18,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:04:18,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:18,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 89228608, now seen corresponding path program 1 times [2025-01-10 06:04:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696547086] [2025-01-10 06:04:18,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:18,969 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:04:18,971 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:04:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:04:19,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:04:19,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:19,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:04:19,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:19,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:19,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696547086] [2025-01-10 06:04:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696547086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71092235] [2025-01-10 06:04:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:19,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:19,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:19,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:04:19,654 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:19,676 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-01-10 06:04:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 06:04:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:19,678 INFO L225 Difference]: With dead ends: 65 [2025-01-10 06:04:19,678 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 06:04:19,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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:04:19,679 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:19,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 06:04:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 06:04:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-01-10 06:04:19,684 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 36 [2025-01-10 06:04:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:19,684 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-01-10 06:04:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-01-10 06:04:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 06:04:19,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:19,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:19,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash 89230530, now seen corresponding path program 1 times [2025-01-10 06:04:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491804432] [2025-01-10 06:04:19,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:19,889 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:04:19,890 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:04:20,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:04:20,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:04:20,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:20,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:20,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:20,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491804432] [2025-01-10 06:04:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491804432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:20,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793576698] [2025-01-10 06:04:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:20,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:20,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:20,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:04:20,590 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:20,620 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-01-10 06:04:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 06:04:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:20,627 INFO L225 Difference]: With dead ends: 88 [2025-01-10 06:04:20,627 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 06:04:20,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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:04:20,627 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:20,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 06:04:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 06:04:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-01-10 06:04:20,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 36 [2025-01-10 06:04:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:20,635 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-01-10 06:04:20,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-01-10 06:04:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 06:04:20,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:20,639 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:20,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 06:04:20,840 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 [2025-01-10 06:04:20,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:20,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash 765138235, now seen corresponding path program 1 times [2025-01-10 06:04:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:20,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649480599] [2025-01-10 06:04:20,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:20,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:20,844 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:04:20,845 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:04:21,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:04:21,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:04:21,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:21,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:21,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:04:21,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:04:21,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649480599] [2025-01-10 06:04:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649480599] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:21,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:04:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750046775] [2025-01-10 06:04:21,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:21,690 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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:04:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:21,962 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2025-01-10 06:04:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 38 [2025-01-10 06:04:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:21,966 INFO L225 Difference]: With dead ends: 85 [2025-01-10 06:04:21,966 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 06:04:21,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:21,967 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:04:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 06:04:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2025-01-10 06:04:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-01-10 06:04:21,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 38 [2025-01-10 06:04:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:21,972 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-01-10 06:04:21,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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:04:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-01-10 06:04:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 06:04:21,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:21,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:22,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:22,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:22,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1306808742, now seen corresponding path program 1 times [2025-01-10 06:04:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:22,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954329834] [2025-01-10 06:04:22,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:22,179 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:22,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:04:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 06:04:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 06:04:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:04:22,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:04:23,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:23,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954329834] [2025-01-10 06:04:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954329834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919963575] [2025-01-10 06:04:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:23,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:23,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:23,006 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:04:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:23,308 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2025-01-10 06:04:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 42 [2025-01-10 06:04:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:23,310 INFO L225 Difference]: With dead ends: 92 [2025-01-10 06:04:23,310 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 06:04:23,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:23,310 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:23,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 154 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:04:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 06:04:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-01-10 06:04:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-10 06:04:23,316 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 42 [2025-01-10 06:04:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:23,317 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-10 06:04:23,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:04:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-10 06:04:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 06:04:23,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:23,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:23,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 06:04:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:23,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2051230418, now seen corresponding path program 1 times [2025-01-10 06:04:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460614281] [2025-01-10 06:04:23,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:23,522 INFO L229 MonitoredProcess]: Starting monitored process 15 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:04:23,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 06:04:23,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 06:04:24,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 06:04:24,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:24,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:24,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:24,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:04:24,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 06:04:24,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460614281] [2025-01-10 06:04:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460614281] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:24,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 06:04:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161842219] [2025-01-10 06:04:24,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:04:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:24,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:04:24,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:04:24,539 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 06:04:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:24,664 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-01-10 06:04:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:04:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2025-01-10 06:04:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:24,666 INFO L225 Difference]: With dead ends: 111 [2025-01-10 06:04:24,666 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 06:04:24,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:04:24,667 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:24,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 237 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 06:04:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 06:04:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-01-10 06:04:24,673 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 52 [2025-01-10 06:04:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-01-10 06:04:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 06:04:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-01-10 06:04:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 06:04:24,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:24,675 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:24,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 06:04:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:24,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash 44139730, now seen corresponding path program 2 times [2025-01-10 06:04:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586145702] [2025-01-10 06:04:24,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:24,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:24,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:24,880 INFO L229 MonitoredProcess]: Starting monitored process 16 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:04:24,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 06:04:25,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-10 06:04:26,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 06:04:26,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:26,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:26,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:26,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 06:04:26,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-10 06:04:26,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586145702] [2025-01-10 06:04:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586145702] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:26,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 06:04:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867900452] [2025-01-10 06:04:26,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:26,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:04:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:26,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:04:26,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:04:26,256 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 06:04:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:26,466 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2025-01-10 06:04:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:04:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 06:04:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:26,467 INFO L225 Difference]: With dead ends: 117 [2025-01-10 06:04:26,467 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 06:04:26,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:04:26,469 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:26,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 06:04:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 06:04:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2025-01-10 06:04:26,476 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 64 [2025-01-10 06:04:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:26,477 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2025-01-10 06:04:26,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 06:04:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2025-01-10 06:04:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 06:04:26,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:26,478 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:26,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 06:04:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:26,679 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:26,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -635693678, now seen corresponding path program 3 times [2025-01-10 06:04:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637947590] [2025-01-10 06:04:26,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:04:26,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:26,682 INFO L229 MonitoredProcess]: Starting monitored process 17 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:04:26,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 06:04:26,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 10 equivalence classes. [2025-01-10 06:04:38,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 76 statements. [2025-01-10 06:04:38,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 06:04:38,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:38,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:04:38,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-10 06:04:39,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:39,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:39,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637947590] [2025-01-10 06:04:39,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637947590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:39,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [359166661] [2025-01-10 06:04:39,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:04:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-10 06:04:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-10 06:04:39,209 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-10 06:04:39,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-01-10 06:04:39,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 10 equivalence classes. [2025-01-10 06:04:42,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 76 statements. [2025-01-10 06:04:42,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 06:04:42,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:42,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:04:42,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-10 06:04:42,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [359166661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:42,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-01-10 06:04:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883793631] [2025-01-10 06:04:42,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:42,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:04:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:42,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:04:42,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:04:42,400 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:43,057 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2025-01-10 06:04:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:04:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 76 [2025-01-10 06:04:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:43,059 INFO L225 Difference]: With dead ends: 150 [2025-01-10 06:04:43,059 INFO L226 Difference]: Without dead ends: 121 [2025-01-10 06:04:43,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:04:43,060 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:43,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 233 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:04:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-10 06:04:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2025-01-10 06:04:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-01-10 06:04:43,076 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 76 [2025-01-10 06:04:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:43,077 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-01-10 06:04:43,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:04:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-01-10 06:04:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:04:43,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:43,078 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:43,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-01-10 06:04:43,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 06:04:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:43,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-01-10 06:04:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash -441342338, now seen corresponding path program 4 times [2025-01-10 06:04:43,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:43,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934381419] [2025-01-10 06:04:43,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:04:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:43,486 INFO L229 MonitoredProcess]: Starting monitored process 19 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:04:43,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 06:04:43,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 98 statements into 2 equivalence classes.