./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:05:30,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:05:30,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:05:30,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:05:30,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:05:30,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:05:30,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:05:30,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:05:30,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:05:30,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:05:30,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:05:30,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:05:30,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:05:30,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:05:30,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:05:30,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:05:30,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:05:30,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:05:30,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:05:30,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:05:30,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:05:30,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:05:30,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:05:30,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:05:30,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:05:30,254 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:05:30,254 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:05:30,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:05:30,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:05:30,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:05:30,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:05:30,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:05:30,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:05:30,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:05:30,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:05:30,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:05:30,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:05:30,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:05:30,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:05:30,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2024-11-19 10:05:30,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:05:30,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:05:30,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:05:30,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:05:30,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:05:30,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2024-11-19 10:05:31,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:05:31,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:05:31,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2024-11-19 10:05:31,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a51e04d/6b9eb94eff074e6aac9613ce7249f074/FLAG577cec35b [2024-11-19 10:05:31,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a51e04d/6b9eb94eff074e6aac9613ce7249f074 [2024-11-19 10:05:31,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:05:31,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:05:31,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:05:31,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:05:31,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:05:31,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:31" (1/1) ... [2024-11-19 10:05:31,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e86be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:31, skipping insertion in model container [2024-11-19 10:05:31,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:31" (1/1) ... [2024-11-19 10:05:31,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:05:32,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:05:32,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:05:32,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:05:32,086 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:05:32,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32 WrapperNode [2024-11-19 10:05:32,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:05:32,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:05:32,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:05:32,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:05:32,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,113 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 150 [2024-11-19 10:05:32,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:05:32,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:05:32,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:05:32,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:05:32,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 10:05:32,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:05:32,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:05:32,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:05:32,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:05:32,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (1/1) ... [2024-11-19 10:05:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:05:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:05:32,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:05:32,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:05:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:05:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:05:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:05:32,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:05:32,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:05:32,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:05:32,463 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-19 10:05:32,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:05:32,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:05:32,472 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:05:32,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:32 BoogieIcfgContainer [2024-11-19 10:05:32,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:05:32,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:05:32,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:05:32,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:05:32,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:05:31" (1/3) ... [2024-11-19 10:05:32,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e958581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:32, skipping insertion in model container [2024-11-19 10:05:32,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:32" (2/3) ... [2024-11-19 10:05:32,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e958581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:32, skipping insertion in model container [2024-11-19 10:05:32,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:32" (3/3) ... [2024-11-19 10:05:32,478 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2024-11-19 10:05:32,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:05:32,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 10:05:32,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:05:32,534 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;@4e992c05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:05:32,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 10:05:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 57 states have internal predecessors, (87), 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) [2024-11-19 10:05:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:05:32,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:32,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:32,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:32,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1479475630, now seen corresponding path program 1 times [2024-11-19 10:05:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593780762] [2024-11-19 10:05:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:05:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:32,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593780762] [2024-11-19 10:05:32,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593780762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:32,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:32,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:05:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585339871] [2024-11-19 10:05:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:32,716 INFO L87 Difference]: Start difference. First operand has 58 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 57 states have internal predecessors, (87), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-19 10:05:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:32,813 INFO L93 Difference]: Finished difference Result 116 states and 178 transitions. [2024-11-19 10:05:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 [2024-11-19 10:05:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:32,822 INFO L225 Difference]: With dead ends: 116 [2024-11-19 10:05:32,822 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 10:05:32,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:32,829 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:32,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:05:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 10:05:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 10:05:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 54 states have internal predecessors, (78), 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) [2024-11-19 10:05:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-19 10:05:32,861 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 10 [2024-11-19 10:05:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:32,862 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-19 10:05:32,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-19 10:05:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-19 10:05:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:05:32,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:32,863 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:32,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:05:32,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:32,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1422755454, now seen corresponding path program 1 times [2024-11-19 10:05:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:32,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390121842] [2024-11-19 10:05:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:05:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390121842] [2024-11-19 10:05:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390121842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:05:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128249278] [2024-11-19 10:05:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:32,918 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-19 10:05:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:32,978 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2024-11-19 10:05:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 [2024-11-19 10:05:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:32,981 INFO L225 Difference]: With dead ends: 112 [2024-11-19 10:05:32,981 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 10:05:32,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:32,983 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:32,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:05:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 10:05:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 10:05:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 58 states have internal predecessors, (82), 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) [2024-11-19 10:05:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2024-11-19 10:05:32,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 15 [2024-11-19 10:05:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:32,990 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-11-19 10:05:32,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2024-11-19 10:05:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2024-11-19 10:05:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:05:32,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:32,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:32,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:05:32,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:32,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 477150990, now seen corresponding path program 1 times [2024-11-19 10:05:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327232972] [2024-11-19 10:05:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:05:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327232972] [2024-11-19 10:05:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327232972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:05:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358855926] [2024-11-19 10:05:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:33,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,049 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-19 10:05:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:33,109 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2024-11-19 10:05:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2024-11-19 10:05:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:33,110 INFO L225 Difference]: With dead ends: 121 [2024-11-19 10:05:33,110 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 10:05:33,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,111 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:33,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:05:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 10:05:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 10:05:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.5) internal successors, (87), 63 states have internal predecessors, (87), 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) [2024-11-19 10:05:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-11-19 10:05:33,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 21 [2024-11-19 10:05:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:33,124 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-11-19 10:05:33,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-19 10:05:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-11-19 10:05:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:05:33,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:33,125 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:05:33,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -202907380, now seen corresponding path program 1 times [2024-11-19 10:05:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062708785] [2024-11-19 10:05:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:05:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062708785] [2024-11-19 10:05:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062708785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:05:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415336366] [2024-11-19 10:05:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:33,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,165 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-19 10:05:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:33,240 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2024-11-19 10:05:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2024-11-19 10:05:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:33,241 INFO L225 Difference]: With dead ends: 140 [2024-11-19 10:05:33,241 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 10:05:33,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,242 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:33,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 98 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:05:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 10:05:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-19 10:05:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 75 states have internal predecessors, (99), 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) [2024-11-19 10:05:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2024-11-19 10:05:33,250 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 21 [2024-11-19 10:05:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:33,250 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2024-11-19 10:05:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-19 10:05:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2024-11-19 10:05:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:05:33,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:33,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:33,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:05:33,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:33,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 368372734, now seen corresponding path program 1 times [2024-11-19 10:05:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901818477] [2024-11-19 10:05:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:05:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:33,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901818477] [2024-11-19 10:05:33,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901818477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:33,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:33,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:05:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221509509] [2024-11-19 10:05:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:33,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,301 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2024-11-19 10:05:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:33,346 INFO L93 Difference]: Finished difference Result 156 states and 206 transitions. [2024-11-19 10:05:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:33,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 27 [2024-11-19 10:05:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:33,347 INFO L225 Difference]: With dead ends: 156 [2024-11-19 10:05:33,348 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:05:33,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,349 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:33,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:05:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:05:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 10:05:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.381578947368421) internal successors, (105), 81 states have internal predecessors, (105), 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) [2024-11-19 10:05:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-11-19 10:05:33,357 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 27 [2024-11-19 10:05:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-11-19 10:05:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2024-11-19 10:05:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-11-19 10:05:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 10:05:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:33,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:33,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:05:33,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash -202270184, now seen corresponding path program 1 times [2024-11-19 10:05:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491101127] [2024-11-19 10:05:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:05:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 10:05:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491101127] [2024-11-19 10:05:33,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491101127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:05:33,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:05:33,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:05:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344141352] [2024-11-19 10:05:33,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:05:33,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:05:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:33,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:05:33,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,422 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-19 10:05:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:33,444 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2024-11-19 10:05:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:05:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 34 [2024-11-19 10:05:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:33,447 INFO L225 Difference]: With dead ends: 82 [2024-11-19 10:05:33,447 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:05:33,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:05:33,448 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:33,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:05:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:05:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 10:05:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 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) [2024-11-19 10:05:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-11-19 10:05:33,457 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 34 [2024-11-19 10:05:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:33,457 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-11-19 10:05:33,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-19 10:05:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-11-19 10:05:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 10:05:33,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:33,458 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:33,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:05:33,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:05:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1975408272, now seen corresponding path program 1 times [2024-11-19 10:05:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568899228] [2024-11-19 10:05:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:05:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:05:33,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:05:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:05:33,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:05:33,493 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:05:33,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 10:05:33,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 10:05:33,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 10:05:33,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 10:05:33,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 10:05:33,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 10:05:33,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:05:33,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:05:33,532 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:05:33,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:05:33 BoogieIcfgContainer [2024-11-19 10:05:33,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:05:33,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:05:33,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:05:33,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:05:33,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:32" (3/4) ... [2024-11-19 10:05:33,540 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:05:33,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:05:33,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:05:33,595 INFO L158 Benchmark]: Toolchain (without parser) took 1737.23ms. Allocated memory is still 159.4MB. Free memory was 120.6MB in the beginning and 128.3MB in the end (delta: -7.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,596 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 113.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:05:33,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 159.4MB. Free memory was 120.6MB in the beginning and 107.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 159.4MB. Free memory was 107.3MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,598 INFO L158 Benchmark]: Boogie Preprocessor took 31.84ms. Allocated memory is still 159.4MB. Free memory was 105.1MB in the beginning and 103.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,598 INFO L158 Benchmark]: RCFGBuilder took 326.83ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 125.8MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,599 INFO L158 Benchmark]: TraceAbstraction took 1064.61ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 44.8MB in the end (delta: 80.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,599 INFO L158 Benchmark]: Witness Printer took 56.34ms. Allocated memory is still 159.4MB. Free memory was 44.8MB in the beginning and 128.3MB in the end (delta: -83.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-19 10:05:33,600 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.70ms. Allocated memory is still 113.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 159.4MB. Free memory was 120.6MB in the beginning and 107.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 159.4MB. Free memory was 107.3MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.84ms. Allocated memory is still 159.4MB. Free memory was 105.1MB in the beginning and 103.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.83ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 125.8MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1064.61ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 44.8MB in the end (delta: 80.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 56.34ms. Allocated memory is still 159.4MB. Free memory was 44.8MB in the beginning and 128.3MB in the end (delta: -83.5MB). Peak memory consumption was 5.1MB. 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: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__verify_mode = __VERIFIER_nondet_int() ; [L24] int s__session__peer = __VERIFIER_nondet_int() ; [L25] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L26] int buf ; [L27] int cb ; [L28] int blastFlag ; [L29] int tmp___1; [L31] s__state = 8466 [L32] blastFlag = 0 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L41] COND TRUE s__state == 8466 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L90] COND TRUE blastFlag == 0 [L91] blastFlag = 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L93] s__state = 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L44] COND TRUE s__state == 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L97] COND TRUE blastFlag == 1 [L98] blastFlag = 2 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L100] COND FALSE !(\read(s__hit)) [L103] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L48] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L108] s__state = 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L52] COND TRUE s__state == 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L112] s__state = 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L52] COND FALSE !(s__state == 8528) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L56] COND TRUE s__state == 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L116] s__verify_mode + 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0] - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: 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, 58 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 425 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 85/85 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:05:33,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)