./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_44_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_44_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 04f5f84b5c2499bd076c6d8fc0e7f827344d1c18ee0ba02949552e10fb884668 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 13:28:19,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 13:28:19,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 13:28:19,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 13:28:19,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 13:28:19,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 13:28:19,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 13:28:19,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 13:28:19,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 13:28:19,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 13:28:19,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 13:28:19,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 13:28:19,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 13:28:19,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 13:28:19,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 13:28:19,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 13:28:19,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 13:28:19,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 13:28:19,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 13:28:19,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 13:28:19,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 13:28:19,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 13:28:19,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 13:28:19,273 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/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 -> 04f5f84b5c2499bd076c6d8fc0e7f827344d1c18ee0ba02949552e10fb884668 [2025-03-04 13:28:19,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 13:28:19,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 13:28:19,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 13:28:19,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 13:28:19,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 13:28:19,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_44_good.i [2025-03-04 13:28:20,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77499cbe/ef02ee47c9d446519519cb03d41aace8/FLAG7ef18867e [2025-03-04 13:28:21,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 13:28:21,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_44_good.i [2025-03-04 13:28:21,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77499cbe/ef02ee47c9d446519519cb03d41aace8/FLAG7ef18867e [2025-03-04 13:28:21,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77499cbe/ef02ee47c9d446519519cb03d41aace8 [2025-03-04 13:28:21,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 13:28:21,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 13:28:21,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 13:28:21,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 13:28:21,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 13:28:21,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a3c939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21, skipping insertion in model container [2025-03-04 13:28:21,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 13:28:21,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 13:28:21,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 13:28:21,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 13:28:21,723 INFO L204 MainTranslator]: Completed translation [2025-03-04 13:28:21,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21 WrapperNode [2025-03-04 13:28:21,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 13:28:21,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 13:28:21,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 13:28:21,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 13:28:21,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,782 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 115 [2025-03-04 13:28:21,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 13:28:21,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 13:28:21,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 13:28:21,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 13:28:21,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,806 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 13:28:21,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 13:28:21,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 13:28:21,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 13:28:21,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 13:28:21,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (1/1) ... [2025-03-04 13:28:21,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 13:28:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 13:28:21,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 13:28:21,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 13:28:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 13:28:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 13:28:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 13:28:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 13:28:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 13:28:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-04 13:28:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-04 13:28:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 13:28:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 13:28:22,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 13:28:22,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 13:28:22,165 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-04 13:28:22,167 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 13:28:22,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 13:28:22,183 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 13:28:22,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:22 BoogieIcfgContainer [2025-03-04 13:28:22,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 13:28:22,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 13:28:22,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 13:28:22,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 13:28:22,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:28:21" (1/3) ... [2025-03-04 13:28:22,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc5f52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:22, skipping insertion in model container [2025-03-04 13:28:22,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:21" (2/3) ... [2025-03-04 13:28:22,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc5f52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:22, skipping insertion in model container [2025-03-04 13:28:22,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:22" (3/3) ... [2025-03-04 13:28:22,191 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_44_good.i [2025-03-04 13:28:22,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 13:28:22,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_44_good.i that has 4 procedures, 65 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 13:28:22,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 13:28:22,250 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;@58f8e37e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 13:28:22,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 13:28:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 50 states have (on average 1.44) internal successors, (72), 55 states have internal predecessors, (72), 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-03-04 13:28:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 13:28:22,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:22,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:22,259 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-03-04 13:28:22,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1400832048, now seen corresponding path program 1 times [2025-03-04 13:28:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684696236] [2025-03-04 13:28:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:22,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 13:28:22,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 13:28:22,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 13:28:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:22,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684696236] [2025-03-04 13:28:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684696236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 13:28:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475084071] [2025-03-04 13:28:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:22,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 13:28:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:22,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 13:28:22,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 13:28:22,548 INFO L87 Difference]: Start difference. First operand has 65 states, 50 states have (on average 1.44) internal successors, (72), 55 states have internal predecessors, (72), 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.5) internal successors, (10), 5 states have internal predecessors, (10), 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-03-04 13:28:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:22,641 INFO L93 Difference]: Finished difference Result 145 states and 194 transitions. [2025-03-04 13:28:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 13:28:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2025-03-04 13:28:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:22,650 INFO L225 Difference]: With dead ends: 145 [2025-03-04 13:28:22,650 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 13:28:22,652 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-03-04 13:28:22,654 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 20 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:22,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 372 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 13:28:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 13:28:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 58 states have internal predecessors, (76), 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-03-04 13:28:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2025-03-04 13:28:22,686 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 13 [2025-03-04 13:28:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:22,688 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2025-03-04 13:28:22,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-03-04 13:28:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2025-03-04 13:28:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 13:28:22,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:22,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 13:28:22,690 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-03-04 13:28:22,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 475812732, now seen corresponding path program 1 times [2025-03-04 13:28:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825892382] [2025-03-04 13:28:22,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:22,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 13:28:22,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 13:28:22,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 13:28:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825892382] [2025-03-04 13:28:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825892382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 13:28:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966774827] [2025-03-04 13:28:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:22,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 13:28:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:22,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 13:28:22,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 13:28:22,808 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-04 13:28:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:22,887 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2025-03-04 13:28:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 13:28:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 14 [2025-03-04 13:28:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:22,888 INFO L225 Difference]: With dead ends: 111 [2025-03-04 13:28:22,889 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 13:28:22,889 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-03-04 13:28:22,890 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:22,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 295 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 13:28:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 13:28:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 13:28:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 57 states have internal predecessors, (72), 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-03-04 13:28:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2025-03-04 13:28:22,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 14 [2025-03-04 13:28:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2025-03-04 13:28:22,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-04 13:28:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2025-03-04 13:28:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 13:28:22,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:22,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:22,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 13:28:22,898 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-03-04 13:28:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 975254450, now seen corresponding path program 1 times [2025-03-04 13:28:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:22,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673008985] [2025-03-04 13:28:22,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:22,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 13:28:22,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 13:28:22,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:22,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 13:28:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673008985] [2025-03-04 13:28:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673008985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25086437] [2025-03-04 13:28:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:22,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:22,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:22,986 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-03-04 13:28:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:23,002 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-03-04 13:28:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:23,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 34 [2025-03-04 13:28:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:23,003 INFO L225 Difference]: With dead ends: 66 [2025-03-04 13:28:23,004 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 13:28:23,005 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-03-04 13:28:23,005 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:23,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 13:28:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 13:28:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 56 states have internal predecessors, (71), 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-03-04 13:28:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-03-04 13:28:23,012 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 34 [2025-03-04 13:28:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-04 13:28:23,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-03-04 13:28:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-03-04 13:28:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 13:28:23,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:23,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 13:28:23,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 13:28:23,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 13:28:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 168116923, now seen corresponding path program 1 times [2025-03-04 13:28:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449014149] [2025-03-04 13:28:23,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 13:28:23,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 13:28:23,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 13:28:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449014149] [2025-03-04 13:28:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449014149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 13:28:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747417403] [2025-03-04 13:28:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 13:28:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:23,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 13:28:23,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 13:28:23,140 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03-04 13:28:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:23,166 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-03-04 13:28:23,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 13:28:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2025-03-04 13:28:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:23,168 INFO L225 Difference]: With dead ends: 67 [2025-03-04 13:28:23,168 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 13:28:23,168 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-03-04 13:28:23,169 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 154 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-03-04 13:28:23,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 154 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 13:28:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 13:28:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 52 states have internal predecessors, (67), 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-03-04 13:28:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 13:28:23,180 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 35 [2025-03-04 13:28:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:23,180 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 13:28:23,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03-04 13:28:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 13:28:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 13:28:23,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:23,181 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, 1, 1, 1] [2025-03-04 13:28:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 13:28:23,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-03-04 13:28:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash 167809082, now seen corresponding path program 1 times [2025-03-04 13:28:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167404214] [2025-03-04 13:28:23,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:23,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 13:28:23,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 13:28:23,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:23,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:23,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:23,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167404214] [2025-03-04 13:28:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167404214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:23,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324928274] [2025-03-04 13:28:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:23,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:23,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:23,234 INFO L87 Difference]: Start difference. First operand 61 states and 76 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, (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-03-04 13:28:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:23,257 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-03-04 13:28:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:23,257 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, (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 35 [2025-03-04 13:28:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:23,259 INFO L225 Difference]: With dead ends: 61 [2025-03-04 13:28:23,259 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 13:28:23,259 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-03-04 13:28:23,260 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:23,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 13:28:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 13:28:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2941176470588236) 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-03-04 13:28:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-04 13:28:23,268 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 35 [2025-03-04 13:28:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:23,269 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-04 13:28:23,269 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, (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-03-04 13:28:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-04 13:28:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 13:28:23,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 13:28:23,271 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, 1, 1, 1, 1] [2025-03-04 13:28:23,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 13:28:23,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-03-04 13:28:23,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 13:28:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash 907114278, now seen corresponding path program 1 times [2025-03-04 13:28:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 13:28:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696834329] [2025-03-04 13:28:23,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 13:28:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 13:28:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 13:28:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 13:28:23,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 13:28:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 13:28:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 13:28:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 13:28:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696834329] [2025-03-04 13:28:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696834329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 13:28:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 13:28:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 13:28:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122020283] [2025-03-04 13:28:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 13:28:23,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 13:28:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 13:28:23,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 13:28:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 13:28:23,319 INFO L87 Difference]: Start difference. First operand 60 states and 75 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, (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-03-04 13:28:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 13:28:23,336 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-04 13:28:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 13:28:23,336 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, (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 36 [2025-03-04 13:28:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 13:28:23,337 INFO L225 Difference]: With dead ends: 60 [2025-03-04 13:28:23,337 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 13:28:23,337 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-03-04 13:28:23,338 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 13:28:23,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 13:28:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 13:28:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 13:28:23,339 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-03-04 13:28:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 13:28:23,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-03-04 13:28:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 13:28:23,340 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 13:28:23,340 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, (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-03-04 13:28:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 13:28:23,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 13:28:23,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 13:28:23,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 13:28:23,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 13:28:23,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 13:28:23,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 13:28:23,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 13:28:23,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 13:28:23,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 13:28:23,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:28:23 BoogieIcfgContainer [2025-03-04 13:28:23,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 13:28:23,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 13:28:23,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 13:28:23,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 13:28:23,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:22" (3/4) ... [2025-03-04 13:28:23,421 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 13:28:23,425 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 13:28:23,425 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 13:28:23,425 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2025-03-04 13:28:23,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 13:28:23,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 13:28:23,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 13:28:23,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 13:28:23,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 13:28:23,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 13:28:23,495 INFO L158 Benchmark]: Toolchain (without parser) took 2400.27ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 102.6MB in the end (delta: -1.2MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2025-03-04 13:28:23,496 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 13:28:23,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.82ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 40.9MB in the end (delta: 60.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 13:28:23,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.17ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 38.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 13:28:23,497 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 142.6MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 13:28:23,497 INFO L158 Benchmark]: IcfgBuilder took 358.52ms. Allocated memory is still 142.6MB. Free memory was 36.4MB in the beginning and 88.1MB in the end (delta: -51.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-03-04 13:28:23,497 INFO L158 Benchmark]: TraceAbstraction took 1233.69ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 41.9MB in the end (delta: 45.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2025-03-04 13:28:23,498 INFO L158 Benchmark]: Witness Printer took 75.91ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 102.6MB in the end (delta: -60.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 13:28:23,499 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.21ms. Allocated memory is still 201.3MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.82ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 40.9MB in the end (delta: 60.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.17ms. Allocated memory is still 142.6MB. Free memory was 40.9MB in the beginning and 38.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 142.6MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.52ms. Allocated memory is still 142.6MB. Free memory was 36.4MB in the beginning and 88.1MB in the end (delta: -51.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1233.69ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 41.9MB in the end (delta: 45.0MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 75.91ms. Allocated memory is still 142.6MB. Free memory was 41.9MB in the beginning and 102.6MB in the end (delta: -60.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1570]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1570]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1552]: 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, 65 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 1191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 395 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 13/13 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-03-04 13:28:23,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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