./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_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_max_multiply_17_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 18932daab2b6a9e703f41380254be4987ae24cad0ed52ef44ca676e3b35352e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:37:22,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:37:22,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:37:22,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:37:22,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:37:22,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:37:22,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:37:22,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:37:22,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:37:22,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:37:22,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:37:22,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:37:22,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:37:22,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:37:22,627 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:37:22,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:37:22,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:37:22,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:37:22,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:37:22,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:37:22,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:37:22,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:37:22,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:37:22,630 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 -> 18932daab2b6a9e703f41380254be4987ae24cad0ed52ef44ca676e3b35352e8 [2025-01-10 04:37:22,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:37:22,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:37:22,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:37:22,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:37:22,976 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:37:22,978 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_max_multiply_17_good.i [2025-01-10 04:37:24,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6162df9/7d6e261b2c8a4ff28b993ad6bb91dc35/FLAG8d1c470d1 [2025-01-10 04:37:24,706 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:37:24,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_good.i [2025-01-10 04:37:24,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6162df9/7d6e261b2c8a4ff28b993ad6bb91dc35/FLAG8d1c470d1 [2025-01-10 04:37:24,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6162df9/7d6e261b2c8a4ff28b993ad6bb91dc35 [2025-01-10 04:37:24,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:37:24,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:37:24,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:37:24,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:37:24,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:37:24,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:37:24" (1/1) ... [2025-01-10 04:37:24,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b86135f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:24, skipping insertion in model container [2025-01-10 04:37:24,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:37:24" (1/1) ... [2025-01-10 04:37:24,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:37:25,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:37:25,574 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:37:25,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:37:25,763 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:37:25,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25 WrapperNode [2025-01-10 04:37:25,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:37:25,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:37:25,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:37:25,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:37:25,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,810 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-01-10 04:37:25,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:37:25,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:37:25,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:37:25,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:37:25,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,829 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:37:25,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:37:25,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:37:25,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:37:25,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:37:25,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (1/1) ... [2025-01-10 04:37:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:37:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:37:25,874 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 04:37:25,879 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 04:37:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:37:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:37:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:37:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:37:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:37:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:37:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:37:26,003 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:37:26,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:37:26,144 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-10 04:37:26,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:37:26,155 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:37:26,156 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:37:26,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:37:26 BoogieIcfgContainer [2025-01-10 04:37:26,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:37:26,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:37:26,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:37:26,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:37:26,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:37:24" (1/3) ... [2025-01-10 04:37:26,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce100a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:37:26, skipping insertion in model container [2025-01-10 04:37:26,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:37:25" (2/3) ... [2025-01-10 04:37:26,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce100a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:37:26, skipping insertion in model container [2025-01-10 04:37:26,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:37:26" (3/3) ... [2025-01-10 04:37:26,166 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_17_good.i [2025-01-10 04:37:26,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:37:26,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_multiply_17_good.i that has 3 procedures, 57 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 04:37:26,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:37:26,260 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;@5ec5df47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:37:26,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 04:37:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 04:37:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 04:37:26,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:26,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:26,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:26,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1153140367, now seen corresponding path program 1 times [2025-01-10 04:37:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768170486] [2025-01-10 04:37:26,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:26,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 04:37:26,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 04:37:26,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:26,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:26,579 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 04:37:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768170486] [2025-01-10 04:37:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768170486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64093733] [2025-01-10 04:37:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:37:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:26,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:37:26,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:37:26,606 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:26,660 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2025-01-10 04:37:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:37:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-10 04:37:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:26,668 INFO L225 Difference]: With dead ends: 110 [2025-01-10 04:37:26,668 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 04:37:26,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 04:37:26,673 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:26,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 185 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 04:37:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-10 04:37:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-01-10 04:37:26,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 10 [2025-01-10 04:37:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:26,713 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-01-10 04:37:26,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-01-10 04:37:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 04:37:26,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:26,715 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:26,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:37:26,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2056291399, now seen corresponding path program 1 times [2025-01-10 04:37:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:26,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170506494] [2025-01-10 04:37:26,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:26,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 04:37:26,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 04:37:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:37:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:26,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170506494] [2025-01-10 04:37:26,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170506494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:37:26,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044516501] [2025-01-10 04:37:26,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:26,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:26,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:37:26,859 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 04:37:26,861 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 04:37:26,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 04:37:26,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 04:37:26,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:26,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:26,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:37:26,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:37:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:37:27,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:37:27,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044516501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:37:27,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:37:27,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565866836] [2025-01-10 04:37:27,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:37:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:37:27,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:27,004 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,037 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-01-10 04:37:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:37:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-10 04:37:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,038 INFO L225 Difference]: With dead ends: 95 [2025-01-10 04:37:27,038 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 04:37:27,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:27,039 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:27,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 04:37:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 04:37:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 43 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-01-10 04:37:27,047 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 13 [2025-01-10 04:37:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,047 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-01-10 04:37:27,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-01-10 04:37:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 04:37:27,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,058 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 04:37:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:27,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -134835691, now seen corresponding path program 1 times [2025-01-10 04:37:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735297057] [2025-01-10 04:37:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:27,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 04:37:27,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 04:37:27,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 04:37:27,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735297057] [2025-01-10 04:37:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735297057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481495176] [2025-01-10 04:37:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:37:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:37:27,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:37:27,329 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,358 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-01-10 04:37:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:37:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 04:37:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,360 INFO L225 Difference]: With dead ends: 82 [2025-01-10 04:37:27,362 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 04:37:27,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:37:27,363 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:27,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 04:37:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-01-10 04:37:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 04:37:27,376 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 16 [2025-01-10 04:37:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,376 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 04:37:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-10 04:37:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 04:37:27,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:37:27,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -135620251, now seen corresponding path program 1 times [2025-01-10 04:37:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844467346] [2025-01-10 04:37:27,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:27,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 04:37:27,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 04:37:27,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:37:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844467346] [2025-01-10 04:37:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844467346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67910212] [2025-01-10 04:37:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:37:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:37:27,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:37:27,445 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,458 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-01-10 04:37:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:37:27,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 04:37:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,459 INFO L225 Difference]: With dead ends: 85 [2025-01-10 04:37:27,459 INFO L226 Difference]: Without dead ends: 44 [2025-01-10 04:37:27,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:37:27,460 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 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 04:37:27,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-10 04:37:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-10 04:37:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:37:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-01-10 04:37:27,465 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 16 [2025-01-10 04:37:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-01-10 04:37:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:37:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-01-10 04:37:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 04:37:27,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:37:27,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:27,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1646210199, now seen corresponding path program 1 times [2025-01-10 04:37:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702195207] [2025-01-10 04:37:27,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:27,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 04:37:27,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 04:37:27,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 04:37:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702195207] [2025-01-10 04:37:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702195207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786503644] [2025-01-10 04:37:27,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:37:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:37:27,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:37:27,542 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:37:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,572 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-01-10 04:37:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:37:27,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-01-10 04:37:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,573 INFO L225 Difference]: With dead ends: 52 [2025-01-10 04:37:27,573 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 04:37:27,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 04:37:27,574 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:27,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 04:37:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 04:37:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-01-10 04:37:27,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22 [2025-01-10 04:37:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-01-10 04:37:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:37:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-01-10 04:37:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 04:37:27,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:37:27,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 886251103, now seen corresponding path program 1 times [2025-01-10 04:37:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305766121] [2025-01-10 04:37:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:27,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 04:37:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 04:37:27,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:37:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305766121] [2025-01-10 04:37:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305766121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284976557] [2025-01-10 04:37:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:37:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:37:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:37:27,653 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,678 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2025-01-10 04:37:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:37:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-01-10 04:37:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,679 INFO L225 Difference]: With dead ends: 71 [2025-01-10 04:37:27,679 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 04:37:27,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 04:37:27,680 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:27,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 04:37:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-10 04:37:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-01-10 04:37:27,690 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 27 [2025-01-10 04:37:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,691 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-01-10 04:37:27,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-01-10 04:37:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 04:37:27,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 04:37:27,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1142734177, now seen corresponding path program 1 times [2025-01-10 04:37:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189410674] [2025-01-10 04:37:27,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:27,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 04:37:27,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 04:37:27,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:37:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189410674] [2025-01-10 04:37:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189410674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:37:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301465538] [2025-01-10 04:37:27,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:27,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:37:27,821 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 04:37:27,823 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 04:37:27,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 04:37:27,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 04:37:27,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:27,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:27,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:37:27,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:37:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:37:27,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:37:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301465538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:37:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:37:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720766443] [2025-01-10 04:37:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:27,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:37:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:27,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:37:27,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:27,926 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:27,946 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-01-10 04:37:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:37:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 04:37:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:27,950 INFO L225 Difference]: With dead ends: 70 [2025-01-10 04:37:27,950 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 04:37:27,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:27,951 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:27,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 04:37:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 04:37:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-01-10 04:37:27,959 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 30 [2025-01-10 04:37:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-01-10 04:37:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-01-10 04:37:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 04:37:27,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:27,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:27,969 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 04:37:28,162 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 04:37:28,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1343893947, now seen corresponding path program 1 times [2025-01-10 04:37:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707428884] [2025-01-10 04:37:28,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 04:37:28,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 04:37:28,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 04:37:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707428884] [2025-01-10 04:37:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707428884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:37:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166052116] [2025-01-10 04:37:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:37:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:28,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:37:28,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:37:28,228 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:28,240 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-01-10 04:37:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:37:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-10 04:37:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:28,243 INFO L225 Difference]: With dead ends: 63 [2025-01-10 04:37:28,243 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 04:37:28,243 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 04:37:28,245 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:28,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 04:37:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 04:37:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-01-10 04:37:28,251 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 32 [2025-01-10 04:37:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:28,252 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-01-10 04:37:28,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:37:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-01-10 04:37:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 04:37:28,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:28,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 04:37:28,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:28,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:28,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1125131935, now seen corresponding path program 1 times [2025-01-10 04:37:28,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392601879] [2025-01-10 04:37:28,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 04:37:28,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 04:37:28,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 04:37:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392601879] [2025-01-10 04:37:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392601879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:37:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026361719] [2025-01-10 04:37:28,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:37:28,331 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 04:37:28,332 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 04:37:28,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 04:37:28,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 04:37:28,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:37:28,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:37:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 04:37:28,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:37:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026361719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:28,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:37:28,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:37:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233992530] [2025-01-10 04:37:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:28,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:37:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:28,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:37:28,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:28,428 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:37:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:28,454 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-01-10 04:37:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:37:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-01-10 04:37:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:28,455 INFO L225 Difference]: With dead ends: 71 [2025-01-10 04:37:28,455 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 04:37:28,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:28,456 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:28,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 04:37:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-10 04:37:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:37:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-01-10 04:37:28,460 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2025-01-10 04:37:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-01-10 04:37:28,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 04:37:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-01-10 04:37:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 04:37:28,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:28,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:28,472 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 04:37:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:28,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1771180087, now seen corresponding path program 1 times [2025-01-10 04:37:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425916538] [2025-01-10 04:37:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 04:37:28,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 04:37:28,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 04:37:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425916538] [2025-01-10 04:37:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425916538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:37:28,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:37:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677818307] [2025-01-10 04:37:28,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 04:37:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:28,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 04:37:28,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 04:37:28,732 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 04:37:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:28,760 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-01-10 04:37:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 04:37:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 40 [2025-01-10 04:37:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:28,761 INFO L225 Difference]: With dead ends: 50 [2025-01-10 04:37:28,761 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 04:37:28,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 04:37:28,762 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:28,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 04:37:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 04:37:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 04:37:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-01-10 04:37:28,771 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 40 [2025-01-10 04:37:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:28,771 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-01-10 04:37:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 04:37:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-01-10 04:37:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 04:37:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:37:28,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 04:37:28,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 04:37:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:37:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966014, now seen corresponding path program 1 times [2025-01-10 04:37:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:37:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555351751] [2025-01-10 04:37:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:37:28,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 04:37:28,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 04:37:28,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 04:37:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:37:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555351751] [2025-01-10 04:37:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555351751] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 04:37:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148140630] [2025-01-10 04:37:28,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:37:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 04:37:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:37:28,893 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 04:37:28,896 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 04:37:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 04:37:28,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 04:37:28,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:37:28,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:37:28,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 04:37:28,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 04:37:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 04:37:29,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 04:37:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148140630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:37:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 04:37:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 04:37:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566388718] [2025-01-10 04:37:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:37:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 04:37:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:37:29,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 04:37:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:29,047 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 04:37:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:37:29,064 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-01-10 04:37:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 04:37:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-01-10 04:37:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:37:29,065 INFO L225 Difference]: With dead ends: 52 [2025-01-10 04:37:29,065 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:37:29,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 04:37:29,066 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:37:29,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:37:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:37:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:37:29,067 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 04:37:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:37:29,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-01-10 04:37:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:37:29,067 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:37:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 04:37:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:37:29,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:37:29,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 04:37:29,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 04:37:29,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 04:37:29,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 04:37:29,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 04:37:29,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 04:37:29,079 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 04:37:29,272 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,SelfDestructingSolverStorable10 [2025-01-10 04:37:29,274 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:37:29,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:37:29,339 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:37:29,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:37:29 BoogieIcfgContainer [2025-01-10 04:37:29,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:37:29,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:37:29,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:37:29,354 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:37:29,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:37:26" (3/4) ... [2025-01-10 04:37:29,357 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:37:29,362 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:37:29,363 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:37:29,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 04:37:29,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 04:37:29,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 04:37:29,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:37:29,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:37:29,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:37:29,454 INFO L158 Benchmark]: Toolchain (without parser) took 4707.40ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 113.5MB in the end (delta: 8.3MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2025-01-10 04:37:29,455 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:37:29,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1019.22ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 62.9MB in the end (delta: 58.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 04:37:29,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.24ms. Allocated memory is still 167.8MB. Free memory was 62.9MB in the beginning and 60.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:37:29,456 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:37:29,456 INFO L158 Benchmark]: RCFGBuilder took 312.31ms. Allocated memory is still 167.8MB. Free memory was 59.0MB in the beginning and 45.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:37:29,456 INFO L158 Benchmark]: TraceAbstraction took 3193.51ms. Allocated memory is still 167.8MB. Free memory was 44.4MB in the beginning and 120.2MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:37:29,457 INFO L158 Benchmark]: Witness Printer took 99.67ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 113.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:37:29,458 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1019.22ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 62.9MB in the end (delta: 58.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.24ms. Allocated memory is still 167.8MB. Free memory was 62.9MB in the beginning and 60.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 312.31ms. Allocated memory is still 167.8MB. Free memory was 59.0MB in the beginning and 45.0MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3193.51ms. Allocated memory is still 167.8MB. Free memory was 44.4MB in the beginning and 120.2MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 99.67ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 113.5MB in the end (delta: 6.7MB). 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: 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 3 procedures, 57 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 1358 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 497 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 117/121 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 12 specifications checked. All of them hold - InvariantResult [Line: 1578]: Loop Invariant Derived loop invariant: (((1 <= h) && (data == 2)) || (h == 0)) - InvariantResult [Line: 1582]: Loop Invariant Derived loop invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((1 <= i) && (2147483647 <= data)) || (i == 0)) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((k == 0) && (2147483647 <= data)) || ((1 <= k) && (2147483647 <= data))) RESULT: Ultimate proved your program to be correct! [2025-01-10 04:37:29,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE