./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:22:40,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:22:40,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:22:40,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:22:40,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:22:40,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:22:40,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:22:40,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:22:40,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:22:40,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:22:40,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:22:40,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:22:40,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:22:40,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:22:40,134 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:22:40,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:22:40,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:40,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:40,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:22:40,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:22:40,137 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 [2025-01-10 01:22:40,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:22:40,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:22:40,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:22:40,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:22:40,376 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:22:40,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2025-01-10 01:22:41,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08a5ef158/fbd7ff20130d4fa08be30a3238c53a94/FLAGc541bbb13 [2025-01-10 01:22:41,815 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:22:41,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2025-01-10 01:22:41,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08a5ef158/fbd7ff20130d4fa08be30a3238c53a94/FLAGc541bbb13 [2025-01-10 01:22:42,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08a5ef158/fbd7ff20130d4fa08be30a3238c53a94 [2025-01-10 01:22:42,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:22:42,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:22:42,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:42,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:22:42,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:22:42,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcb1f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42, skipping insertion in model container [2025-01-10 01:22:42,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:22:42,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:42,337 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:22:42,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:42,379 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:22:42,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42 WrapperNode [2025-01-10 01:22:42,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:42,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:42,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:22:42,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:22:42,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,415 INFO L138 Inliner]: procedures = 116, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-01-10 01:22:42,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:42,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:22:42,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:22:42,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:22:42,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,439 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-01-10 01:22:42,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:22:42,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:22:42,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:22:42,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:22:42,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (1/1) ... [2025-01-10 01:22:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:42,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:42,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:22:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:22:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:22:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:22:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:22:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:22:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:22:42,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:22:42,568 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:22:42,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:22:42,691 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 01:22:42,691 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:22:42,697 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:22:42,699 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:22:42,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:42 BoogieIcfgContainer [2025-01-10 01:22:42,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:22:42,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:22:42,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:22:42,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:22:42,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:22:42" (1/3) ... [2025-01-10 01:22:42,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69971dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:42, skipping insertion in model container [2025-01-10 01:22:42,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:42" (2/3) ... [2025-01-10 01:22:42,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69971dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:42, skipping insertion in model container [2025-01-10 01:22:42,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:42" (3/3) ... [2025-01-10 01:22:42,708 INFO L128 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca-1.i [2025-01-10 01:22:42,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:22:42,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stroeder2-alloca-1.i that has 1 procedures, 30 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-01-10 01:22:42,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:22:42,772 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d8cf96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:22:42,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:22:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.619047619047619) internal successors, (34), 29 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-01-10 01:22:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:22:42,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:42,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:22:42,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:42,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 889508744, now seen corresponding path program 1 times [2025-01-10 01:22:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259019528] [2025-01-10 01:22:42,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:22:42,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:22:42,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:42,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:42,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-01-10 01:22:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259019528] [2025-01-10 01:22:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259019528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323062392] [2025-01-10 01:22:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:42,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:42,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:42,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:42,995 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.619047619047619) internal successors, (34), 29 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:43,042 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-01-10 01:22:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-01-10 01:22:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:43,049 INFO L225 Difference]: With dead ends: 56 [2025-01-10 01:22:43,049 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:22:43,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:43,054 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:43,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:22:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:22:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-10 01:22:43,078 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2025-01-10 01:22:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:43,078 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-10 01:22:43,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-10 01:22:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:22:43,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:43,079 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:22:43,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -593177271, now seen corresponding path program 1 times [2025-01-10 01:22:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944138461] [2025-01-10 01:22:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:43,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:22:43,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:22:43,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:43,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944138461] [2025-01-10 01:22:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944138461] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381626387] [2025-01-10 01:22:43,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:43,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:43,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:22:43,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:22:43,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:22:43,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:43,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:43,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:22:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381626387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:22:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:22:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467241736] [2025-01-10 01:22:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:22:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:43,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:22:43,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:43,312 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:43,352 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-01-10 01:22:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2025-01-10 01:22:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:43,353 INFO L225 Difference]: With dead ends: 29 [2025-01-10 01:22:43,353 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:22:43,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:43,354 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:43,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:22:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:22:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-10 01:22:43,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2025-01-10 01:22:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:43,358 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-10 01:22:43,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-10 01:22:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:43,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:43,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:43,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:22:43,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:43,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1029145935, now seen corresponding path program 1 times [2025-01-10 01:22:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688147407] [2025-01-10 01:22:43,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:43,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:43,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:43,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688147407] [2025-01-10 01:22:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688147407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:22:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534469202] [2025-01-10 01:22:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:43,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:43,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:43,648 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:43,664 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-01-10 01:22:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-01-10 01:22:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:43,665 INFO L225 Difference]: With dead ends: 45 [2025-01-10 01:22:43,665 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:22:43,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 01:22:43,665 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:43,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:22:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:22:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-10 01:22:43,670 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2025-01-10 01:22:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-10 01:22:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-10 01:22:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:43,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:43,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:22:43,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1208626170, now seen corresponding path program 1 times [2025-01-10 01:22:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652415642] [2025-01-10 01:22:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:43,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652415642] [2025-01-10 01:22:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652415642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049721213] [2025-01-10 01:22:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:43,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:43,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:22:43,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:43,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:43,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:43,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049721213] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:43,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:43,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-01-10 01:22:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746304138] [2025-01-10 01:22:43,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:43,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:22:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:22:43,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:22:43,892 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:43,944 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-01-10 01:22:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:22:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 10 [2025-01-10 01:22:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:43,946 INFO L225 Difference]: With dead ends: 63 [2025-01-10 01:22:43,946 INFO L226 Difference]: Without dead ends: 42 [2025-01-10 01:22:43,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:22:43,947 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:43,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-10 01:22:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-10 01:22:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-01-10 01:22:43,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 10 [2025-01-10 01:22:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:43,952 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-01-10 01:22:43,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-01-10 01:22:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:22:43,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:43,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:43,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:44,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:44,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1291865102, now seen corresponding path program 1 times [2025-01-10 01:22:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638116830] [2025-01-10 01:22:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:44,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:22:44,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:22:44,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:44,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638116830] [2025-01-10 01:22:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638116830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:44,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500109110] [2025-01-10 01:22:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:44,200 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:44,222 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-01-10 01:22:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:44,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-01-10 01:22:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:44,226 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:22:44,226 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:22:44,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:44,226 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:44,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:22:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-01-10 01:22:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.391304347826087) internal successors, (64), 52 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-01-10 01:22:44,233 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 13 [2025-01-10 01:22:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:44,233 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-01-10 01:22:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-01-10 01:22:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:22:44,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:44,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:22:44,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1291867408, now seen corresponding path program 1 times [2025-01-10 01:22:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:44,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508799554] [2025-01-10 01:22:44,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:22:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:22:44,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:44,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508799554] [2025-01-10 01:22:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508799554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254433394] [2025-01-10 01:22:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:44,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:44,288 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:44,304 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-01-10 01:22:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:44,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-01-10 01:22:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:44,305 INFO L225 Difference]: With dead ends: 74 [2025-01-10 01:22:44,305 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 01:22:44,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:44,305 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:44,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 01:22:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-01-10 01:22:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-01-10 01:22:44,316 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 13 [2025-01-10 01:22:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-01-10 01:22:44,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-01-10 01:22:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:22:44,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:44,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:44,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:22:44,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:44,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -239028366, now seen corresponding path program 1 times [2025-01-10 01:22:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364715812] [2025-01-10 01:22:44,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:44,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:22:44,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:22:44,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:44,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364715812] [2025-01-10 01:22:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364715812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:22:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620672096] [2025-01-10 01:22:44,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:44,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:22:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:44,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:22:44,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:22:44,394 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-01-10 01:22:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:44,423 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-01-10 01:22:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:22:44,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) Word has length 15 [2025-01-10 01:22:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:44,424 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:22:44,424 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 01:22:44,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:22:44,425 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:44,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 01:22:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-10 01:22:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-01-10 01:22:44,429 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 15 [2025-01-10 01:22:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:44,429 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-01-10 01:22:44,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-01-10 01:22:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-01-10 01:22:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:22:44,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:44,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:44,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:22:44,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:22:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1180055318, now seen corresponding path program 1 times [2025-01-10 01:22:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455198697] [2025-01-10 01:22:44,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:44,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:22:44,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:22:44,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:22:44,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:22:44,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:22:44,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:22:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:22:44,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:22:44,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:22:44,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 01:22:44,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 01:22:44,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 01:22:44,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 01:22:44,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 01:22:44,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 01:22:44,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 01:22:44,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 01:22:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:22:44,476 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:44,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:22:44,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:22:44 BoogieIcfgContainer [2025-01-10 01:22:44,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:22:44,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:22:44,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:22:44,510 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:22:44,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:42" (3/4) ... [2025-01-10 01:22:44,511 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:22:44,536 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-01-10 01:22:44,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:22:44,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:22:44,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:22:44,569 INFO L158 Benchmark]: Toolchain (without parser) took 2452.53ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 107.0MB in the end (delta: 2.6MB). Peak memory consumption was 182.2kB. Max. memory is 16.1GB. [2025-01-10 01:22:44,569 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:44,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.21ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 92.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:22:44,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.79ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 92.0MB in the end (delta: 917.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:44,570 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:44,570 INFO L158 Benchmark]: RCFGBuilder took 249.63ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 78.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:22:44,570 INFO L158 Benchmark]: TraceAbstraction took 1808.42ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 113.2MB in the end (delta: -36.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-01-10 01:22:44,571 INFO L158 Benchmark]: Witness Printer took 57.80ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 107.0MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:44,572 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.21ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 92.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.79ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 92.0MB in the end (delta: 917.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 249.63ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 78.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1808.42ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 113.2MB in the end (delta: -36.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Witness Printer took 57.80ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 107.0MB in the end (delta: 5.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 - CounterExampleResult [Line: 522]: integer overflow possible integer overflow possible We found a FailurePath: [L528] int array_size = __VERIFIER_nondet_int(); [L529] COND TRUE array_size < 1 || array_size >= 2147483647 / sizeof(int) [L530] array_size = 1 VAL [array_size=1] [L532] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); [L534] int i = 0; VAL [array_size=1, i=0, numbers={3:0}] [L534] COND TRUE i < array_size [L536] numbers[i] = __VERIFIER_nondet_int() [L534] i++ VAL [array_size=1, i=1, numbers={3:0}] [L534] COND FALSE !(i < array_size) [L539] CALL sumOfThirdBytes(numbers, array_size) [L514] int i, sum; [L515] char* p; [L516] sum = 0 [L517] i = 0 VAL [array_size=1, i=0, numbers={3:0}, sum=0] [L517] COND TRUE i < array_size [L518] p = &(numbers[i]) [L519] p = p + 2 VAL [array_size=1, i=0, numbers={3:0}, p={3:2}, sum=0] [L520] EXPR \read(*p) [L520] COND TRUE *p > 0 [L521] sum++ [L522] EXPR \read(*p) [L522] (*p)-- VAL [array_size=1, i=0, numbers={3:0}, p={3:2}, sum=1] - UnprovableResult [Line: 534]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 517]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 517]: 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, 30 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 572 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 7/16 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 proved your program to be incorrect! [2025-01-10 01:22:44,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)