./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/bitvector/modulus-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/bitvector/modulus-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:31,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:31,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:31,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:31,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:31,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:31,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:31,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:31,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:31,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:31,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:31,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:31,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:31,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:31,248 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:31,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:31,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:31,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:31,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:31,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:31,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:31,250 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c [2025-04-30 10:18:31,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:31,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:31,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:31,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:31,460 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:31,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/modulus-2.i [2025-04-30 10:18:32,809 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008eb5a18/f6d76e1ba1e940fb907b5574d0277d1d/FLAG4e96f62b1 [2025-04-30 10:18:32,983 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:32,983 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i [2025-04-30 10:18:32,991 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008eb5a18/f6d76e1ba1e940fb907b5574d0277d1d/FLAG4e96f62b1 [2025-04-30 10:18:33,859 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008eb5a18/f6d76e1ba1e940fb907b5574d0277d1d [2025-04-30 10:18:33,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:33,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:33,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:33,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:33,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:33,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:33" (1/1) ... [2025-04-30 10:18:33,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9990d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:33, skipping insertion in model container [2025-04-30 10:18:33,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:33" (1/1) ... [2025-04-30 10:18:33,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:34,032 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:34,043 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:34,073 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:34,087 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:34,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34 WrapperNode [2025-04-30 10:18:34,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:34,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:34,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:34,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:34,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,111 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-04-30 10:18:34,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:34,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:34,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:34,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:34,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,130 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:18:34,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:34,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:34,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:34,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:34,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (1/1) ... [2025-04-30 10:18:34,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:34,163 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-04-30 10:18:34,164 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-04-30 10:18:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:34,228 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:34,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:34,391 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-04-30 10:18:34,391 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:34,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:34,398 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:34,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:34 BoogieIcfgContainer [2025-04-30 10:18:34,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:34,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:34,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:34,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:34,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:33" (1/3) ... [2025-04-30 10:18:34,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f572d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:34, skipping insertion in model container [2025-04-30 10:18:34,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:34" (2/3) ... [2025-04-30 10:18:34,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f572d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:34, skipping insertion in model container [2025-04-30 10:18:34,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:34" (3/3) ... [2025-04-30 10:18:34,409 INFO L128 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2025-04-30 10:18:34,421 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:34,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG modulus-2.i that has 1 procedures, 37 locations, 47 edges, 1 initial locations, 2 loop locations, and 5 error locations. [2025-04-30 10:18:34,467 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:34,476 INFO L340 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;@5806cd8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:34,477 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:18:34,480 INFO L278 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 36 states have internal predecessors, (47), 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-04-30 10:18:34,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:18:34,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:18:34,483 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:34,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 28693827, now seen corresponding path program 1 times [2025-04-30 10:18:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749175982] [2025-04-30 10:18:34,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:18:34,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:18:34,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749175982] [2025-04-30 10:18:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749175982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326350108] [2025-04-30 10:18:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:18:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:18:34,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:34,617 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 36 states have internal predecessors, (47), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04-30 10:18:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,634 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2025-04-30 10:18:34,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:18:34,635 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-30 10:18:34,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,640 INFO L225 Difference]: With dead ends: 70 [2025-04-30 10:18:34,640 INFO L226 Difference]: Without dead ends: 16 [2025-04-30 10:18:34,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:34,644 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-04-30 10:18:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-30 10:18:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 15 states have internal predecessors, (16), 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-04-30 10:18:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-04-30 10:18:34,669 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 5 [2025-04-30 10:18:34,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,669 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-04-30 10:18:34,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04-30 10:18:34,669 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-04-30 10:18:34,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:18:34,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:18:34,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:34,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:34,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2025-04-30 10:18:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310211367] [2025-04-30 10:18:34,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:18:34,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:18:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:34,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310211367] [2025-04-30 10:18:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310211367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:34,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014387604] [2025-04-30 10:18:34,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:34,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:34,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:34,821 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-04-30 10:18:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,841 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-04-30 10:18:34,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:34,842 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2025-04-30 10:18:34,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,842 INFO L225 Difference]: With dead ends: 16 [2025-04-30 10:18:34,843 INFO L226 Difference]: Without dead ends: 15 [2025-04-30 10:18:34,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:34,843 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-30 10:18:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-30 10:18:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 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-04-30 10:18:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-04-30 10:18:34,846 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2025-04-30 10:18:34,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,849 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-04-30 10:18:34,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-04-30 10:18:34,850 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-04-30 10:18:34,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:18:34,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:34,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:18:34,850 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:34,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1806812427, now seen corresponding path program 1 times [2025-04-30 10:18:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073919534] [2025-04-30 10:18:34,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073919534] [2025-04-30 10:18:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073919534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573538735] [2025-04-30 10:18:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:34,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:34,895 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04-30 10:18:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,921 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2025-04-30 10:18:34,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:34,922 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-04-30 10:18:34,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,923 INFO L225 Difference]: With dead ends: 23 [2025-04-30 10:18:34,923 INFO L226 Difference]: Without dead ends: 15 [2025-04-30 10:18:34,923 INFO L436 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-04-30 10:18:34,923 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-30 10:18:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-30 10:18:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 14 states have internal predecessors, (14), 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-04-30 10:18:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2025-04-30 10:18:34,925 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 7 [2025-04-30 10:18:34,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,925 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2025-04-30 10:18:34,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-04-30 10:18:34,925 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2025-04-30 10:18:34,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:18:34,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:34,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:34,928 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:34,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash 176612268, now seen corresponding path program 1 times [2025-04-30 10:18:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195121312] [2025-04-30 10:18:34,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:18:34,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:18:34,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195121312] [2025-04-30 10:18:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195121312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540228486] [2025-04-30 10:18:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:34,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:34,979 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-30 10:18:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,994 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2025-04-30 10:18:34,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:34,995 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-04-30 10:18:34,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,995 INFO L225 Difference]: With dead ends: 15 [2025-04-30 10:18:34,995 INFO L226 Difference]: Without dead ends: 13 [2025-04-30 10:18:34,995 INFO L436 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-04-30 10:18:34,996 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-04-30 10:18:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-30 10:18:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 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-04-30 10:18:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2025-04-30 10:18:34,997 INFO L79 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 8 [2025-04-30 10:18:34,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,997 INFO L485 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2025-04-30 10:18:34,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-30 10:18:35,000 INFO L278 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2025-04-30 10:18:35,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:18:35,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:35,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:35,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:18:35,001 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:35,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1180013064, now seen corresponding path program 1 times [2025-04-30 10:18:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:35,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080208286] [2025-04-30 10:18:35,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:35,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:18:35,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:18:35,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:18:35,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:18:35,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:18:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:18:35,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:18:35,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:18:35,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:18:35,051 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2025-04-30 10:18:35,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2025-04-30 10:18:35,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2025-04-30 10:18:35,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2025-04-30 10:18:35,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2025-04-30 10:18:35,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:35,058 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:18:35,081 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:18:35,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:18:35 BoogieIcfgContainer [2025-04-30 10:18:35,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:18:35,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:18:35,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:18:35,084 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:18:35,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:34" (3/4) ... [2025-04-30 10:18:35,086 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:18:35,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:18:35,088 INFO L158 Benchmark]: Toolchain (without parser) took 1225.30ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 67.3MB in the end (delta: 65.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-04-30 10:18:35,089 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:35,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.83ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 118.9MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:35,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.91ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 117.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:35,091 INFO L158 Benchmark]: Boogie Preprocessor took 27.79ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:35,091 INFO L158 Benchmark]: RCFGBuilder took 257.78ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 103.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:35,091 INFO L158 Benchmark]: TraceAbstraction took 683.27ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 67.3MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:18:35,091 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 167.8MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:35,093 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.27ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.83ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 118.9MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.91ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 117.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.79ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.78ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 103.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 683.27ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 67.3MB in the end (delta: 35.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 167.8MB. Free memory is still 67.3MB. 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 - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of shiftLeft at line 51. Possible FailurePath: [L46] unsigned int n = __VERIFIER_nondet_uint(); [L47] unsigned int s = __VERIFIER_nondet_uint(); [L48] unsigned int d; [L49] unsigned int m; [L50] CALL assume_abort_if_not(s < 31) [L11] COND FALSE !(!cond) [L50] RET assume_abort_if_not(s < 31) [L51] 1 << s VAL [s=30] - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 47 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 73 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:18:35,106 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../../../trunk/examples/svcomp/bitvector/modulus-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 32bit --witnessprinter.graph.data.programhash 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:36,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:36,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-04-30 10:18:36,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:36,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:36,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:37,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:37,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:37,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:37,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:37,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:37,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:37,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:37,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:37,002 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:37,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:37,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:37,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:37,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:37,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:37,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:37,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:37,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:37,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:37,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:37,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:37,006 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c [2025-04-30 10:18:37,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:37,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:37,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:37,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:37,251 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:37,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/modulus-2.i [2025-04-30 10:18:38,504 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad6b5cf/603d5ad416bd4c8dadb2d17eb0538969/FLAG945ddcc59 [2025-04-30 10:18:38,691 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:38,692 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i [2025-04-30 10:18:38,697 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad6b5cf/603d5ad416bd4c8dadb2d17eb0538969/FLAG945ddcc59 [2025-04-30 10:18:39,504 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad6b5cf/603d5ad416bd4c8dadb2d17eb0538969 [2025-04-30 10:18:39,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:39,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:39,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:39,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:39,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:39,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6071622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39, skipping insertion in model container [2025-04-30 10:18:39,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:39,665 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:39,673 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:39,698 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:39,711 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:39,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39 WrapperNode [2025-04-30 10:18:39,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:39,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:39,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:39,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:39,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,738 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 47 [2025-04-30 10:18:39,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:39,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:39,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:39,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:39,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:18:39,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:39,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:39,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:39,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:39,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (1/1) ... [2025-04-30 10:18:39,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:39,817 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-04-30 10:18:39,819 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-04-30 10:18:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:18:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:39,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:39,887 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:39,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:40,056 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-04-30 10:18:40,056 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:40,062 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:40,062 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:40,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:40 BoogieIcfgContainer [2025-04-30 10:18:40,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:40,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:40,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:40,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:40,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:39" (1/3) ... [2025-04-30 10:18:40,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346cf0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:40, skipping insertion in model container [2025-04-30 10:18:40,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:39" (2/3) ... [2025-04-30 10:18:40,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346cf0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:40, skipping insertion in model container [2025-04-30 10:18:40,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:40" (3/3) ... [2025-04-30 10:18:40,070 INFO L128 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2025-04-30 10:18:40,080 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:40,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG modulus-2.i that has 1 procedures, 28 locations, 34 edges, 1 initial locations, 2 loop locations, and 5 error locations. [2025-04-30 10:18:40,114 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:40,121 INFO L340 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;@4b025f17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:40,121 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:18:40,124 INFO L278 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 27 states have internal predecessors, (34), 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-04-30 10:18:40,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:18:40,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:40,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:18:40,128 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:40,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash 28693827, now seen corresponding path program 1 times [2025-04-30 10:18:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:18:40,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362450872] [2025-04-30 10:18:40,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:40,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:40,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:18:40,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:18:40,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:18:40,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:40,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:40,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-30 10:18:40,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:40,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:40,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:18:40,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362450872] [2025-04-30 10:18:40,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362450872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:40,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:40,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452708441] [2025-04-30 10:18:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:40,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:18:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:18:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:18:40,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:40,228 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 27 states have internal predecessors, (34), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04-30 10:18:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:40,242 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-04-30 10:18:40,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:18:40,244 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-30 10:18:40,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:40,248 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:18:40,248 INFO L226 Difference]: Without dead ends: 12 [2025-04-30 10:18:40,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:40,254 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:40,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-04-30 10:18:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-04-30 10:18:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 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-04-30 10:18:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2025-04-30 10:18:40,279 INFO L79 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 5 [2025-04-30 10:18:40,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:40,279 INFO L485 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2025-04-30 10:18:40,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04-30 10:18:40,280 INFO L278 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2025-04-30 10:18:40,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:18:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:40,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:18:40,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:18:40,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,485 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2025-04-30 10:18:40,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2025-04-30 10:18:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:18:40,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934995837] [2025-04-30 10:18:40,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:40,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:40,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:18:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:18:40,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:18:40,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:40,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:40,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:18:40,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:40,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:40,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:18:40,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934995837] [2025-04-30 10:18:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934995837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128941668] [2025-04-30 10:18:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:40,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:18:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:40,603 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-04-30 10:18:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:40,626 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2025-04-30 10:18:40,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:40,626 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2025-04-30 10:18:40,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:40,627 INFO L225 Difference]: With dead ends: 12 [2025-04-30 10:18:40,627 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:18:40,627 INFO L436 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-04-30 10:18:40,627 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:40,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:18:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:18:40,628 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-04-30 10:18:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:18:40,628 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2025-04-30 10:18:40,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:40,628 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:18:40,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-04-30 10:18:40,629 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:18:40,629 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:18:40,632 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2025-04-30 10:18:40,632 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2025-04-30 10:18:40,632 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2025-04-30 10:18:40,632 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2025-04-30 10:18:40,633 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2025-04-30 10:18:40,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:18:40,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,836 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-30 10:18:40,837 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:18:40,845 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:18:40,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:18:40 BoogieIcfgContainer [2025-04-30 10:18:40,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:18:40,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:18:40,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:18:40,856 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:18:40,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:40" (3/4) ... [2025-04-30 10:18:40,862 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:18:40,867 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-30 10:18:40,868 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:18:40,868 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:18:40,868 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:18:40,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:18:40,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:18:40,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:18:40,952 INFO L158 Benchmark]: Toolchain (without parser) took 1444.54ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 87.8MB in the end (delta: 4.7MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:40,952 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:40,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.83ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:40,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.58ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:40,956 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:40,956 INFO L158 Benchmark]: RCFGBuilder took 285.44ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 64.1MB in the end (delta: 10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:40,956 INFO L158 Benchmark]: TraceAbstraction took 789.97ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 40.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:18:40,957 INFO L158 Benchmark]: Witness Printer took 95.62ms. Allocated memory is still 117.4MB. Free memory was 40.3MB in the beginning and 87.8MB in the end (delta: -47.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:40,958 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.22ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.83ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.58ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.44ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 64.1MB in the end (delta: 10.7MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 789.97ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 40.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 95.62ms. Allocated memory is still 117.4MB. Free memory was 40.3MB in the beginning and 87.8MB in the end (delta: -47.5MB). Peak memory consumption was 13.8MB. 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: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: 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 1 procedures, 28 locations, 34 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 32 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:18:40,970 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