./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_09_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/CWE191_Integer_Underflow__int_fscanf_multiply_09_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 5eb485cc54b325dc018756cfe0c5ac2bdd73ee8525d13f9fde3d8a47aade66b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:28:27,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:28:27,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:28:27,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:28:27,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:28:27,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:28:27,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:28:27,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:28:27,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:28:27,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:28:27,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:28:27,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:28:27,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:28:27,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:28:27,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:28:27,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:28:27,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:28:27,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:28:27,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:28:27,278 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 -> 5eb485cc54b325dc018756cfe0c5ac2bdd73ee8525d13f9fde3d8a47aade66b3 [2025-01-10 05:28:27,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:28:27,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:28:27,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:28:27,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:28:27,504 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:28:27,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_09_good.i [2025-01-10 05:28:28,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac7a73d2/07abb00fc56a44b0accb3813d8c963c4/FLAG7fff90cdd [2025-01-10 05:28:29,151 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:28:29,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_09_good.i [2025-01-10 05:28:29,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac7a73d2/07abb00fc56a44b0accb3813d8c963c4/FLAG7fff90cdd [2025-01-10 05:28:29,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac7a73d2/07abb00fc56a44b0accb3813d8c963c4 [2025-01-10 05:28:29,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:28:29,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:28:29,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:28:29,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:28:29,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:28:29,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:28:29" (1/1) ... [2025-01-10 05:28:29,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab9cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:29, skipping insertion in model container [2025-01-10 05:28:29,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:28:29" (1/1) ... [2025-01-10 05:28:29,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:28:30,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:28:30,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:28:30,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:28:30,285 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:28:30,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30 WrapperNode [2025-01-10 05:28:30,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:28:30,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:28:30,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:28:30,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:28:30,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,319 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2025-01-10 05:28:30,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:28:30,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:28:30,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:28:30,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:28:30,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,336 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 05:28:30,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:28:30,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:28:30,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:28:30,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:28:30,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (1/1) ... [2025-01-10 05:28:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:28:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:28:30,377 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 05:28:30,387 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 05:28:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:28:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:28:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:28:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:28:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:28:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:28:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:28:30,501 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:28:30,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:28:30,614 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-01-10 05:28:30,618 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:28:30,629 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:28:30,629 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:28:30,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:28:30 BoogieIcfgContainer [2025-01-10 05:28:30,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:28:30,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:28:30,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:28:30,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:28:30,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:28:29" (1/3) ... [2025-01-10 05:28:30,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900bafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:28:30, skipping insertion in model container [2025-01-10 05:28:30,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:28:30" (2/3) ... [2025-01-10 05:28:30,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900bafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:28:30, skipping insertion in model container [2025-01-10 05:28:30,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:28:30" (3/3) ... [2025-01-10 05:28:30,638 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_09_good.i [2025-01-10 05:28:30,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:28:30,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_multiply_09_good.i that has 3 procedures, 63 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 05:28:30,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:28:30,707 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;@27cc47b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:28:30,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 05:28:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 54 states have internal predecessors, (65), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:28:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 05:28:30,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:30,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:30,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1856280403, now seen corresponding path program 1 times [2025-01-10 05:28:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994449169] [2025-01-10 05:28:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:30,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 05:28:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 05:28:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:30,965 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 05:28:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994449169] [2025-01-10 05:28:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994449169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:30,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745199011] [2025-01-10 05:28:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:30,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:30,991 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 54 states have internal predecessors, (65), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 05:28:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,052 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2025-01-10 05:28:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 05:28:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,059 INFO L225 Difference]: With dead ends: 116 [2025-01-10 05:28:31,060 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 05:28:31,063 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 05:28:31,066 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 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 05:28:31,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 05:28:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-01-10 05:28:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 49 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-01-10 05:28:31,121 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 13 [2025-01-10 05:28:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,122 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-01-10 05:28:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 05:28:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-01-10 05:28:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 05:28:31,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:28:31,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1710117711, now seen corresponding path program 1 times [2025-01-10 05:28:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704654617] [2025-01-10 05:28:31,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 05:28:31,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 05:28:31,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,180 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 05:28:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704654617] [2025-01-10 05:28:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704654617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767491553] [2025-01-10 05:28:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,182 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:28:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,195 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2025-01-10 05:28:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-01-10 05:28:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,199 INFO L225 Difference]: With dead ends: 56 [2025-01-10 05:28:31,199 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 05:28:31,200 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 05:28:31,200 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 05:28:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-10 05:28:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 48 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2025-01-10 05:28:31,212 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 14 [2025-01-10 05:28:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,212 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-01-10 05:28:31,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:28:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2025-01-10 05:28:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 05:28:31,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:28:31,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 57631016, now seen corresponding path program 1 times [2025-01-10 05:28:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593025468] [2025-01-10 05:28:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 05:28:31,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 05:28:31,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,284 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 05:28:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593025468] [2025-01-10 05:28:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593025468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678315750] [2025-01-10 05:28:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,289 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 05:28:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,323 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2025-01-10 05:28:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2025-01-10 05:28:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,326 INFO L225 Difference]: With dead ends: 86 [2025-01-10 05:28:31,326 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 05:28:31,326 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 05:28:31,327 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 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 05:28:31,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 05:28:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-01-10 05:28:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.5) internal successors, (63), 50 states have internal predecessors, (63), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-01-10 05:28:31,337 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 17 [2025-01-10 05:28:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,337 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-01-10 05:28:31,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 05:28:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2025-01-10 05:28:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 05:28:31,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:28:31,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1786561591, now seen corresponding path program 1 times [2025-01-10 05:28:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839541525] [2025-01-10 05:28:31,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 05:28:31,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 05:28:31,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,399 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 05:28:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839541525] [2025-01-10 05:28:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839541525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186606108] [2025-01-10 05:28:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,401 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,414 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2025-01-10 05:28:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 05:28:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,415 INFO L225 Difference]: With dead ends: 57 [2025-01-10 05:28:31,415 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 05:28:31,415 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 05:28:31,416 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 05:28:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 05:28:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 49 states have internal predecessors, (62), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-01-10 05:28:31,420 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 18 [2025-01-10 05:28:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-01-10 05:28:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-01-10 05:28:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 05:28:31,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:28:31,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 169227211, now seen corresponding path program 1 times [2025-01-10 05:28:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450032393] [2025-01-10 05:28:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 05:28:31,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 05:28:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:28:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450032393] [2025-01-10 05:28:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450032393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:28:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477174976] [2025-01-10 05:28:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,451 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,469 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2025-01-10 05:28:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-10 05:28:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,470 INFO L225 Difference]: With dead ends: 97 [2025-01-10 05:28:31,470 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 05:28:31,471 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 05:28:31,471 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 57 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 05:28:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 05:28:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2025-01-10 05:28:31,498 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 19 [2025-01-10 05:28:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2025-01-10 05:28:31,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2025-01-10 05:28:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 05:28:31,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:28:31,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash -655440739, now seen corresponding path program 1 times [2025-01-10 05:28:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513684988] [2025-01-10 05:28:31,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 05:28:31,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 05:28:31,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,533 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 05:28:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513684988] [2025-01-10 05:28:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513684988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458126007] [2025-01-10 05:28:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,535 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,547 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-01-10 05:28:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 05:28:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,548 INFO L225 Difference]: With dead ends: 50 [2025-01-10 05:28:31,548 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 05:28:31,549 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 05:28:31,549 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 05:28:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 05:28:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 42 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-01-10 05:28:31,554 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 20 [2025-01-10 05:28:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,554 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-01-10 05:28:31,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-01-10 05:28:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 05:28:31,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:28:31,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1156173696, now seen corresponding path program 1 times [2025-01-10 05:28:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854690249] [2025-01-10 05:28:31,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 05:28:31,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 05:28:31,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,587 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 05:28:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854690249] [2025-01-10 05:28:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854690249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746905029] [2025-01-10 05:28:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,588 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,602 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2025-01-10 05:28:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 05:28:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,603 INFO L225 Difference]: With dead ends: 62 [2025-01-10 05:28:31,603 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 05:28:31,603 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 05:28:31,604 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 05:28:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-10 05:28:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:28:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-01-10 05:28:31,608 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 21 [2025-01-10 05:28:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,608 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-01-10 05:28:31,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:28:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-01-10 05:28:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 05:28:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,609 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] [2025-01-10 05:28:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:28:31,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -541605454, now seen corresponding path program 1 times [2025-01-10 05:28:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374015145] [2025-01-10 05:28:31,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 05:28:31,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 05:28:31,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:28:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374015145] [2025-01-10 05:28:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374015145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:28:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613757554] [2025-01-10 05:28:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,637 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 05:28:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,647 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2025-01-10 05:28:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2025-01-10 05:28:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,649 INFO L225 Difference]: With dead ends: 86 [2025-01-10 05:28:31,649 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 05:28:31,649 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 05:28:31,649 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 05:28:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-10 05:28:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:28:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-10 05:28:31,655 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2025-01-10 05:28:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,656 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 05:28:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 05:28:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-01-10 05:28:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 05:28:31,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 05:28:31,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1576407311, now seen corresponding path program 1 times [2025-01-10 05:28:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086017024] [2025-01-10 05:28:31,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:28:31,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:28:31,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,689 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 05:28:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086017024] [2025-01-10 05:28:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086017024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543594859] [2025-01-10 05:28:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,691 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 05:28:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,698 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-10 05:28:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 31 [2025-01-10 05:28:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,699 INFO L225 Difference]: With dead ends: 46 [2025-01-10 05:28:31,699 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 05:28:31,700 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 05:28:31,700 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 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 05:28:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 05:28:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 05:28:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:28:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-10 05:28:31,704 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2025-01-10 05:28:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-10 05:28:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 05:28:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-10 05:28:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 05:28:31,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:28:31,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 05:28:31,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:28:31,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:28:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1623986535, now seen corresponding path program 1 times [2025-01-10 05:28:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:28:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23124063] [2025-01-10 05:28:31,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:28:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:28:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 05:28:31,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 05:28:31,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:28:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:28:31,733 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 05:28:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:28:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23124063] [2025-01-10 05:28:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23124063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:28:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:28:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:28:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379952813] [2025-01-10 05:28:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:28:31,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:28:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:28:31,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:28:31,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:28:31,735 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 05:28:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:28:31,740 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-01-10 05:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:28:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 05:28:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:28:31,741 INFO L225 Difference]: With dead ends: 45 [2025-01-10 05:28:31,741 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:28:31,742 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 05:28:31,742 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:28:31,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:28:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:28:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:28:31,743 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 05:28:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:28:31,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-01-10 05:28:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:28:31,745 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:28:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 05:28:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:28:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:28:31,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 05:28:31,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 05:28:31,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 05:28:31,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 05:28:31,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 05:28:31,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 05:28:31,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 05:28:31,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 05:28:31,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 05:28:31,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:28:31,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:28:31,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:28:31,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:28:31 BoogieIcfgContainer [2025-01-10 05:28:31,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:28:31,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:28:31,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:28:31,832 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:28:31,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:28:30" (3/4) ... [2025-01-10 05:28:31,834 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:28:31,838 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:28:31,838 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:28:31,843 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 05:28:31,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 05:28:31,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 05:28:31,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:28:31,912 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:28:31,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:28:31,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:28:31,913 INFO L158 Benchmark]: Toolchain (without parser) took 2597.90ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 53.3MB in the end (delta: 49.5MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,913 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:28:31,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 968.88ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 42.2MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.17ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,915 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:28:31,915 INFO L158 Benchmark]: RCFGBuilder took 279.87ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 92.6MB in the end (delta: -54.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,915 INFO L158 Benchmark]: TraceAbstraction took 1199.92ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 59.3MB in the end (delta: 32.6MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,915 INFO L158 Benchmark]: Witness Printer took 81.32ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 53.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:28:31,916 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 968.88ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 42.2MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.17ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.87ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 92.6MB in the end (delta: -54.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1199.92ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 59.3MB in the end (delta: 32.6MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Witness Printer took 81.32ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 53.3MB in the end (delta: 6.0MB). 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: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 1061 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 610 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 05:28:31,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE