./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_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 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:10:11,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:10:12,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:10:12,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:10:12,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:10:12,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:10:12,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:10:12,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:10:12,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:10:12,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:10:12,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:10:12,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:10:12,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:10:12,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:10:12,080 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:10:12,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:10:12,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:10:12,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:10:12,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:10:12,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:10:12,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:10:12,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:10:12,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:10:12,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:10:12,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:10:12,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:10:12,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:10:12,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:10:12,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:10:12,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:10:12,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:10:12,085 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 -> 58013d922b6ea61b441d7b9812a4ff6f833ad15cea27fa85e4b4fc2ce4889815 [2025-02-08 12:10:12,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:10:12,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:10:12,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:10:12,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:10:12,431 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:10:12,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2025-02-08 12:10:13,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e69fcbcd7/c363a2db84f542f3849caf7b47f3af51/FLAG6f7a07a25 [2025-02-08 12:10:14,250 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:10:14,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2025-02-08 12:10:14,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e69fcbcd7/c363a2db84f542f3849caf7b47f3af51/FLAG6f7a07a25 [2025-02-08 12:10:14,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e69fcbcd7/c363a2db84f542f3849caf7b47f3af51 [2025-02-08 12:10:14,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:10:14,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:10:14,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:10:14,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:10:14,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:10:14,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:14" (1/1) ... [2025-02-08 12:10:14,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56404cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14, skipping insertion in model container [2025-02-08 12:10:14,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:14" (1/1) ... [2025-02-08 12:10:14,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:10:14,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:10:15,003 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:10:15,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:10:15,215 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:10:15,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15 WrapperNode [2025-02-08 12:10:15,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:10:15,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:10:15,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:10:15,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:10:15,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,269 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2025-02-08 12:10:15,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:10:15,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:10:15,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:10:15,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:10:15,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,290 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 12:10:15,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:10:15,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:10:15,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:10:15,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:10:15,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (1/1) ... [2025-02-08 12:10:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:10:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:10:15,334 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-02-08 12:10:15,337 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-02-08 12:10:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 12:10:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 12:10:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:10:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:10:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:10:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 12:10:15,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 12:10:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:10:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:10:15,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:10:15,511 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:10:15,814 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-08 12:10:15,814 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:10:15,839 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:10:15,839 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:10:15,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:15 BoogieIcfgContainer [2025-02-08 12:10:15,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:10:15,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:10:15,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:10:15,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:10:15,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:14" (1/3) ... [2025-02-08 12:10:15,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290a8d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:15, skipping insertion in model container [2025-02-08 12:10:15,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:15" (2/3) ... [2025-02-08 12:10:15,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290a8d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:15, skipping insertion in model container [2025-02-08 12:10:15,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:15" (3/3) ... [2025-02-08 12:10:15,858 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_65_good.i [2025-02-08 12:10:15,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:10:15,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_preinc_65_good.i that has 4 procedures, 59 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 12:10:15,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:10:15,964 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;@44c811b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:10:15,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 12:10:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 49 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 12:10:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 12:10:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:10:15,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:10:15,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 12:10:15,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:10:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2086934498, now seen corresponding path program 1 times [2025-02-08 12:10:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:10:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018194023] [2025-02-08 12:10:15,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:10:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:10:16,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 12:10:16,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 12:10:16,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:10:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:10:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:10:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:10:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018194023] [2025-02-08 12:10:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018194023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:10:16,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:10:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 12:10:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633655912] [2025-02-08 12:10:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:10:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 12:10:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:10:16,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 12:10:16,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:10:16,406 INFO L87 Difference]: Start difference. First operand has 59 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 49 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:10:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:10:16,549 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2025-02-08 12:10:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 12:10:16,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 12:10:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:10:16,560 INFO L225 Difference]: With dead ends: 78 [2025-02-08 12:10:16,560 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 12:10:16,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 12:10:16,570 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 16 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 12:10:16,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 341 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 12:10:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 12:10:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-08 12:10:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 12:10:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2025-02-08 12:10:16,617 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 11 [2025-02-08 12:10:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:10:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2025-02-08 12:10:16,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:10:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2025-02-08 12:10:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 12:10:16,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:10:16,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:10:16,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:10:16,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 12:10:16,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:10:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash 270453084, now seen corresponding path program 1 times [2025-02-08 12:10:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:10:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220104028] [2025-02-08 12:10:16,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:10:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:10:16,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:10:16,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:10:16,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:10:16,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:10:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:10:16,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:10:16,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220104028] [2025-02-08 12:10:16,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220104028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:10:16,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:10:16,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 12:10:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303664794] [2025-02-08 12:10:16,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:10:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 12:10:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:10:16,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 12:10:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:10:16,799 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:10:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:10:16,909 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2025-02-08 12:10:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 12:10:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 12:10:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:10:16,914 INFO L225 Difference]: With dead ends: 103 [2025-02-08 12:10:16,915 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 12:10:16,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 12:10:16,917 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 12:10:16,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 280 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 12:10:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 12:10:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 12:10:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.375) internal successors, (66), 51 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:10:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-02-08 12:10:16,930 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 12 [2025-02-08 12:10:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:10:16,930 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-02-08 12:10:16,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:10:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-02-08 12:10:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 12:10:16,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:10:16,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:10:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 12:10:16,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 12:10:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:10:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1497288963, now seen corresponding path program 1 times [2025-02-08 12:10:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:10:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294242582] [2025-02-08 12:10:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:10:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:10:16,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 12:10:16,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 12:10:16,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:10:16,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:10:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:10:17,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:10:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294242582] [2025-02-08 12:10:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294242582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:10:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:10:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 12:10:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621501733] [2025-02-08 12:10:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:10:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:10:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:10:17,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:10:17,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:10:17,231 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:10:17,289 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2025-02-08 12:10:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:10:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-02-08 12:10:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:10:17,291 INFO L225 Difference]: With dead ends: 62 [2025-02-08 12:10:17,291 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 12:10:17,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:10:17,292 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:10:17,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 143 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:10:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 12:10:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-08 12:10:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:10:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-02-08 12:10:17,303 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2025-02-08 12:10:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:10:17,304 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-02-08 12:10:17,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-02-08 12:10:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 12:10:17,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:10:17,305 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:10:17,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:10:17,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 12:10:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:10:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -828689317, now seen corresponding path program 1 times [2025-02-08 12:10:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:10:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728179459] [2025-02-08 12:10:17,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:10:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:10:17,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 12:10:17,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 12:10:17,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:10:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:10:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:10:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:10:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728179459] [2025-02-08 12:10:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728179459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:10:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:10:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 12:10:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618607980] [2025-02-08 12:10:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:10:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 12:10:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:10:17,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 12:10:17,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 12:10:17,528 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:10:17,607 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-02-08 12:10:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 12:10:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-08 12:10:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:10:17,608 INFO L225 Difference]: With dead ends: 56 [2025-02-08 12:10:17,610 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 12:10:17,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 12:10:17,611 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:10:17,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 293 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:10:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 12:10:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 12:10:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:10:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-02-08 12:10:17,625 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 31 [2025-02-08 12:10:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:10:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-02-08 12:10:17,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-02-08 12:10:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 12:10:17,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:10:17,627 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:10:17,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 12:10:17,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 12:10:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:10:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 80434977, now seen corresponding path program 1 times [2025-02-08 12:10:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:10:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918935505] [2025-02-08 12:10:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:10:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:10:17,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 12:10:17,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 12:10:17,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:10:17,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:10:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 12:10:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:10:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918935505] [2025-02-08 12:10:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918935505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:10:17,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:10:17,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:10:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879163916] [2025-02-08 12:10:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:10:17,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:10:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:10:17,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:10:17,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:10:17,696 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:10:17,723 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-02-08 12:10:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:10:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-02-08 12:10:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:10:17,724 INFO L225 Difference]: With dead ends: 55 [2025-02-08 12:10:17,725 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 12:10:17,725 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-02-08 12:10:17,726 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:10:17,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:10:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 12:10:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 12:10:17,728 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-02-08 12:10:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 12:10:17,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-02-08 12:10:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:10:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 12:10:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:10:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 12:10:17,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 12:10:17,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 12:10:17,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 12:10:17,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 12:10:17,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 12:10:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 12:10:17,735 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 12:10:17,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 12:10:17,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:10:17,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:10:17 BoogieIcfgContainer [2025-02-08 12:10:17,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:10:17,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:10:17,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:10:17,862 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:10:17,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:15" (3/4) ... [2025-02-08 12:10:17,864 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 12:10:17,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 12:10:17,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 12:10:17,870 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-02-08 12:10:17,876 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 12:10:17,876 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 12:10:17,876 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 12:10:17,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 12:10:17,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 12:10:17,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:10:17,944 INFO L158 Benchmark]: Toolchain (without parser) took 3640.40ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 93.5MB in the end (delta: 17.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 911.10ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 51.6MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.28ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 48.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: Boogie Preprocessor took 29.06ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 46.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: IcfgBuilder took 539.68ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 97.1MB in the end (delta: -50.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-02-08 12:10:17,945 INFO L158 Benchmark]: TraceAbstraction took 2014.16ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 100.0MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:10:17,946 INFO L158 Benchmark]: Witness Printer took 83.57ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 93.5MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:10:17,947 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 911.10ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 51.6MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.28ms. Allocated memory is still 142.6MB. Free memory was 51.6MB in the beginning and 48.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.06ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 46.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 539.68ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 97.1MB in the end (delta: -50.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2014.16ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 100.0MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.57ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 93.5MB in the end (delta: 5.5MB). There was no memory consumed. 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: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 1172 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 860 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 312 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=1, InterpolantAutomatonStates: 25, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 12:10:17,965 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