./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_08_good.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/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_08_good.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 6686bf4630552f072d8c9f4a2840dc11defb498badf4acf7ac6bbd53cabc98e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 03:53:40,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 03:53:40,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 03:53:40,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 03:53:40,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 03:53:40,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 03:53:40,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 03:53:40,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 03:53:40,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 03:53:40,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 03:53:40,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 03:53:40,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 03:53:40,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 03:53:40,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 03:53:40,139 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 03:53:40,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 03:53:40,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 03:53:40,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 03:53:40,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 03:53:40,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:53:40,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:40,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:40,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 03:53:40,141 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 03:53:40,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 03:53:40,142 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 -> 6686bf4630552f072d8c9f4a2840dc11defb498badf4acf7ac6bbd53cabc98e5 [2025-01-10 03:53:40,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 03:53:40,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 03:53:40,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 03:53:40,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 03:53:40,390 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 03:53:40,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_08_good.i [2025-01-10 03:53:41,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f8d913a/a48fe71a34634f4b93003322c8736e8b/FLAGa61422894 [2025-01-10 03:53:41,943 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 03:53:41,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_08_good.i [2025-01-10 03:53:41,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f8d913a/a48fe71a34634f4b93003322c8736e8b/FLAGa61422894 [2025-01-10 03:53:41,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f8d913a/a48fe71a34634f4b93003322c8736e8b [2025-01-10 03:53:41,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 03:53:41,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 03:53:41,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 03:53:41,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 03:53:41,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 03:53:41,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:41" (1/1) ... [2025-01-10 03:53:41,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a192059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:41, skipping insertion in model container [2025-01-10 03:53:41,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:41" (1/1) ... [2025-01-10 03:53:42,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 03:53:42,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:53:42,552 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 03:53:42,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:53:42,694 INFO L204 MainTranslator]: Completed translation [2025-01-10 03:53:42,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42 WrapperNode [2025-01-10 03:53:42,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 03:53:42,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 03:53:42,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 03:53:42,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 03:53:42,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,732 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 117 [2025-01-10 03:53:42,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 03:53:42,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 03:53:42,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 03:53:42,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 03:53:42,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,751 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 03:53:42,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 03:53:42,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 03:53:42,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 03:53:42,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 03:53:42,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (1/1) ... [2025-01-10 03:53:42,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:53:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:42,796 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 03:53:42,799 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 03:53:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 03:53:42,830 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 03:53:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 03:53:42,830 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 03:53:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 03:53:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 03:53:42,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 03:53:42,831 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-01-10 03:53:42,831 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-01-10 03:53:42,831 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-01-10 03:53:42,831 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-01-10 03:53:42,932 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 03:53:42,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 03:53:43,073 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-10 03:53:43,073 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 03:53:43,080 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 03:53:43,081 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 03:53:43,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:43 BoogieIcfgContainer [2025-01-10 03:53:43,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 03:53:43,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 03:53:43,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 03:53:43,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 03:53:43,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:53:41" (1/3) ... [2025-01-10 03:53:43,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1800d0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:43, skipping insertion in model container [2025-01-10 03:53:43,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:42" (2/3) ... [2025-01-10 03:53:43,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1800d0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:43, skipping insertion in model container [2025-01-10 03:53:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:43" (3/3) ... [2025-01-10 03:53:43,088 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_add_08_good.i [2025-01-10 03:53:43,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 03:53:43,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_add_08_good.i that has 5 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 03:53:43,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 03:53:43,160 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;@167f3337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 03:53:43,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 03:53:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:53:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 03:53:43,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:43,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:43,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:43,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1192752490, now seen corresponding path program 1 times [2025-01-10 03:53:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954566534] [2025-01-10 03:53:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:43,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 03:53:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 03:53:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:43,449 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 03:53:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:43,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954566534] [2025-01-10 03:53:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954566534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:43,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:43,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:43,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799340717] [2025-01-10 03:53:43,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:43,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:43,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:43,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:43,474 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:53:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:43,508 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2025-01-10 03:53:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:43,509 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-01-10 03:53:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:43,513 INFO L225 Difference]: With dead ends: 82 [2025-01-10 03:53:43,513 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 03:53:43,515 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 03:53:43,517 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:43,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 03:53:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-01-10 03:53:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 54 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:53:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-01-10 03:53:43,547 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 22 [2025-01-10 03:53:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:43,548 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-01-10 03:53:43,549 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 03:53:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-01-10 03:53:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 03:53:43,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:43,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 03:53:43,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1679378543, now seen corresponding path program 1 times [2025-01-10 03:53:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620222877] [2025-01-10 03:53:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 03:53:43,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 03:53:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:43,613 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 03:53:43,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620222877] [2025-01-10 03:53:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620222877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:43,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:43,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426844503] [2025-01-10 03:53:43,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:43,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:43,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:43,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:43,614 INFO L87 Difference]: Start difference. First operand 71 states and 92 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, (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 03:53:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:43,645 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2025-01-10 03:53:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:43,646 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, (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 23 [2025-01-10 03:53:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:43,648 INFO L225 Difference]: With dead ends: 131 [2025-01-10 03:53:43,649 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 03:53:43,649 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 03:53:43,649 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:43,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 03:53:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-01-10 03:53:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 56 states have internal predecessors, (63), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:53:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2025-01-10 03:53:43,657 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 23 [2025-01-10 03:53:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:43,658 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2025-01-10 03:53:43,658 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, (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 03:53:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2025-01-10 03:53:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 03:53:43,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:43,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:43,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 03:53:43,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:43,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1523660820, now seen corresponding path program 1 times [2025-01-10 03:53:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735916244] [2025-01-10 03:53:43,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 03:53:43,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 03:53:43,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:43,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:53:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:43,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735916244] [2025-01-10 03:53:43,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735916244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:43,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 03:53:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125319521] [2025-01-10 03:53:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:43,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:53:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:43,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:53:43,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:53:43,756 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:53:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:43,783 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2025-01-10 03:53:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:53:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-01-10 03:53:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:43,784 INFO L225 Difference]: With dead ends: 127 [2025-01-10 03:53:43,785 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 03:53:43,785 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 03:53:43,785 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:43,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 03:53:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 03:53:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:53:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2025-01-10 03:53:43,796 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 40 [2025-01-10 03:53:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:43,798 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2025-01-10 03:53:43,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:53:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2025-01-10 03:53:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 03:53:43,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:43,799 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:43,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 03:53:43,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:43,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 792919792, now seen corresponding path program 1 times [2025-01-10 03:53:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:43,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946509443] [2025-01-10 03:53:43,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 03:53:43,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 03:53:43,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:43,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:53:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946509443] [2025-01-10 03:53:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946509443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:43,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:43,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320231371] [2025-01-10 03:53:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:43,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:43,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:43,892 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:53:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:43,917 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-01-10 03:53:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-01-10 03:53:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:43,918 INFO L225 Difference]: With dead ends: 74 [2025-01-10 03:53:43,918 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 03:53:43,918 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 03:53:43,919 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 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 03:53:43,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 03:53:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-01-10 03:53:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 03:53:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-01-10 03:53:43,924 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 41 [2025-01-10 03:53:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-01-10 03:53:43,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 03:53:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-01-10 03:53:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 03:53:43,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:43,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:43,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 03:53:43,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:43,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1189290128, now seen corresponding path program 1 times [2025-01-10 03:53:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282033015] [2025-01-10 03:53:43,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:43,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 03:53:43,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 03:53:43,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:43,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 03:53:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282033015] [2025-01-10 03:53:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282033015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:53:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 03:53:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63264759] [2025-01-10 03:53:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:43,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:43,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:43,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 03:53:43,976 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 03:53:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:43,998 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2025-01-10 03:53:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:44,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-01-10 03:53:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:44,003 INFO L225 Difference]: With dead ends: 116 [2025-01-10 03:53:44,003 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 03:53:44,004 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 03:53:44,004 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:44,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 03:53:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-01-10 03:53:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.26) internal successors, (63), 56 states have internal predecessors, (63), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:53:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2025-01-10 03:53:44,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 42 [2025-01-10 03:53:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2025-01-10 03:53:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 03:53:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2025-01-10 03:53:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 03:53:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:44,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2025-01-10 03:53:44,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 03:53:44,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:44,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2019893220, now seen corresponding path program 1 times [2025-01-10 03:53:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630365329] [2025-01-10 03:53:44,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:44,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 03:53:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 03:53:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 03:53:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630365329] [2025-01-10 03:53:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630365329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:44,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980437144] [2025-01-10 03:53:44,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:44,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:44,098 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 03:53:44,099 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 03:53:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 03:53:44,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 03:53:44,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:44,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 03:53:44,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980437144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943251949] [2025-01-10 03:53:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:44,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:44,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:44,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:44,213 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:53:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:44,225 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2025-01-10 03:53:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:44,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2025-01-10 03:53:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:44,227 INFO L225 Difference]: With dead ends: 82 [2025-01-10 03:53:44,227 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 03:53:44,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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 03:53:44,227 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:44,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 03:53:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-01-10 03:53:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 58 states have internal predecessors, (67), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:53:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2025-01-10 03:53:44,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 53 [2025-01-10 03:53:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:44,238 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2025-01-10 03:53:44,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:53:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2025-01-10 03:53:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 03:53:44,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:44,239 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2025-01-10 03:53:44,250 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 03:53:44,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:44,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1807819496, now seen corresponding path program 1 times [2025-01-10 03:53:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79928221] [2025-01-10 03:53:44,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:44,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 03:53:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 03:53:44,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 03:53:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79928221] [2025-01-10 03:53:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79928221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302991597] [2025-01-10 03:53:44,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:44,526 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 03:53:44,545 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 03:53:44,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 03:53:44,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 03:53:44,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:44,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 03:53:44,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302991597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443072464] [2025-01-10 03:53:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:44,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:44,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:44,626 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:53:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:44,642 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2025-01-10 03:53:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2025-01-10 03:53:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:44,643 INFO L225 Difference]: With dead ends: 80 [2025-01-10 03:53:44,643 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 03:53:44,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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 03:53:44,644 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 153 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 03:53:44,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 03:53:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-01-10 03:53:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:53:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-01-10 03:53:44,656 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 54 [2025-01-10 03:53:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:44,656 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-01-10 03:53:44,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 03:53:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-01-10 03:53:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 03:53:44,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:44,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:44,669 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 03:53:44,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:44,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:44,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash -193621162, now seen corresponding path program 1 times [2025-01-10 03:53:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302321815] [2025-01-10 03:53:44,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:44,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 03:53:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 03:53:44,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 03:53:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302321815] [2025-01-10 03:53:44,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302321815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566650005] [2025-01-10 03:53:44,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:44,922 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 03:53:44,924 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 03:53:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 03:53:44,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 03:53:44,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:44,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:44,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:44,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 03:53:45,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566650005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:45,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128147820] [2025-01-10 03:53:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:45,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:45,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:45,014 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 03:53:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:45,026 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2025-01-10 03:53:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-01-10 03:53:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:45,028 INFO L225 Difference]: With dead ends: 79 [2025-01-10 03:53:45,028 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 03:53:45,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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 03:53:45,029 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:45,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 03:53:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-01-10 03:53:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.22) internal successors, (61), 54 states have internal predecessors, (61), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:53:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2025-01-10 03:53:45,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 58 [2025-01-10 03:53:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2025-01-10 03:53:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 03:53:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2025-01-10 03:53:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 03:53:45,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:45,042 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:45,048 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 03:53:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:45,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:45,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1767587623, now seen corresponding path program 1 times [2025-01-10 03:53:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50366098] [2025-01-10 03:53:45,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:45,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 03:53:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 03:53:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 03:53:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50366098] [2025-01-10 03:53:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50366098] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208742498] [2025-01-10 03:53:45,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:45,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:45,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:45,307 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 03:53:45,309 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 03:53:45,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 03:53:45,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 03:53:45,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:45,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:45,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:45,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 03:53:45,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:45,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208742498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:45,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:45,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236256785] [2025-01-10 03:53:45,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:45,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:45,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:45,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:45,388 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:45,396 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2025-01-10 03:53:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:45,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-01-10 03:53:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:45,398 INFO L225 Difference]: With dead ends: 79 [2025-01-10 03:53:45,398 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 03:53:45,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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 03:53:45,400 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:45,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 03:53:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-01-10 03:53:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 03:53:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-01-10 03:53:45,410 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 66 [2025-01-10 03:53:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-01-10 03:53:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-01-10 03:53:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 03:53:45,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:45,412 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:45,418 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 03:53:45,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 03:53:45,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 958240997, now seen corresponding path program 1 times [2025-01-10 03:53:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691940269] [2025-01-10 03:53:45,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:45,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 03:53:45,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 03:53:45,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:45,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 03:53:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691940269] [2025-01-10 03:53:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691940269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897812272] [2025-01-10 03:53:45,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:45,681 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 03:53:45,683 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 03:53:45,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 03:53:45,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 03:53:45,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:45,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:45,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:45,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 03:53:45,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897812272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:45,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:45,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:45,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243732707] [2025-01-10 03:53:45,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:45,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:45,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:45,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:45,756 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:45,762 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2025-01-10 03:53:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2025-01-10 03:53:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:45,763 INFO L225 Difference]: With dead ends: 77 [2025-01-10 03:53:45,763 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 03:53:45,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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 03:53:45,764 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:45,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 03:53:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-01-10 03:53:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 03:53:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2025-01-10 03:53:45,769 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 66 [2025-01-10 03:53:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:45,769 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2025-01-10 03:53:45,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2025-01-10 03:53:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 03:53:45,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:53:45,770 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:45,776 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 03:53:45,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 03:53:45,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 03:53:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:53:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1039358388, now seen corresponding path program 1 times [2025-01-10 03:53:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:53:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326191419] [2025-01-10 03:53:45,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:45,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:53:45,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 03:53:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 03:53:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 03:53:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:53:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326191419] [2025-01-10 03:53:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326191419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 03:53:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298051702] [2025-01-10 03:53:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:53:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:53:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:53:46,021 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 03:53:46,023 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 03:53:46,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 03:53:46,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 03:53:46,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:53:46,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:53:46,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 03:53:46,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:53:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 03:53:46,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:53:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298051702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:53:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 03:53:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 03:53:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400504937] [2025-01-10 03:53:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:53:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 03:53:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:53:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 03:53:46,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 03:53:46,099 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:53:46,107 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-01-10 03:53:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 03:53:46,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-01-10 03:53:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:53:46,108 INFO L225 Difference]: With dead ends: 72 [2025-01-10 03:53:46,108 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 03:53:46,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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 03:53:46,109 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:53:46,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:53:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 03:53:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 03:53:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 03:53:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 03:53:46,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2025-01-10 03:53:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:53:46,109 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 03:53:46,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 03:53:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 03:53:46,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 03:53:46,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 03:53:46,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 03:53:46,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 03:53:46,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 03:53:46,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 03:53:46,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 03:53:46,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 03:53:46,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 03:53:46,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 03:53:46,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 03:53:46,316 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:53:46,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 03:53:46,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 03:53:46,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:46 BoogieIcfgContainer [2025-01-10 03:53:46,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 03:53:46,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 03:53:46,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 03:53:46,373 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 03:53:46,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:43" (3/4) ... [2025-01-10 03:53:46,375 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 03:53:46,379 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 03:53:46,379 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-01-10 03:53:46,379 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 03:53:46,380 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-01-10 03:53:46,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-10 03:53:46,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 03:53:46,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 03:53:46,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 03:53:46,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 03:53:46,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 03:53:46,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 03:53:46,450 INFO L158 Benchmark]: Toolchain (without parser) took 4464.18ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 54.9MB in the end (delta: 54.6MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.84ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 49.8MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.54ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 46.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: Boogie Preprocessor took 32.10ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: RCFGBuilder took 315.04ms. Allocated memory is still 142.6MB. Free memory was 45.4MB in the beginning and 98.4MB in the end (delta: -53.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: TraceAbstraction took 3290.13ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 61.1MB in the end (delta: 37.3MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,450 INFO L158 Benchmark]: Witness Printer took 76.07ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 54.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:53:46,451 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.24ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.84ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 49.8MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.54ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 46.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.10ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 315.04ms. Allocated memory is still 142.6MB. Free memory was 45.4MB in the beginning and 98.4MB in the end (delta: -53.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3290.13ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 61.1MB in the end (delta: 37.3MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 76.07ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 54.9MB in the end (delta: 6.3MB). 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 - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 1879 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 946 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 1049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1136 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 493/517 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 03:53:46,462 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 Writing output log to file Ultimate.log Result: TRUE