./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:03:45,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:03:45,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 22:03:45,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:03:45,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:03:45,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:03:45,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:03:45,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:03:45,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:03:45,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:03:45,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:03:45,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:03:45,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:03:45,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:03:45,424 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:03:45,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:03:45,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:03:45,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 22:03:45,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:03:45,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:03:45,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:03:45,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:03:45,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:03:45,430 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:03:45,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:03:45,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:03:45,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:03:45,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:03:45,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:03:45,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:03:45,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:03:45,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:03:45,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:03:45,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:03:45,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:03:45,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 22:03:45,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 22:03:45,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:03:45,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:03:45,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:03:45,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:03:45,435 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 [2024-10-24 22:03:45,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:03:45,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:03:45,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:03:45,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:03:45,757 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:03:45,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:47,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:03:47,475 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:03:47,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:47,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90c3734b/cc4523ece1fb44aea64de3fde94ede12/FLAG89684b9b4 [2024-10-24 22:03:47,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90c3734b/cc4523ece1fb44aea64de3fde94ede12 [2024-10-24 22:03:47,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:03:47,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:03:47,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:03:47,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:03:47,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:03:47,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:47" (1/1) ... [2024-10-24 22:03:47,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b476c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:47, skipping insertion in model container [2024-10-24 22:03:47,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:47" (1/1) ... [2024-10-24 22:03:47,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:03:48,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:03:48,286 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:03:48,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:03:48,447 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:03:48,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48 WrapperNode [2024-10-24 22:03:48,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:03:48,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:03:48,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:03:48,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:03:48,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,515 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-10-24 22:03:48,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:03:48,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:03:48,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:03:48,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:03:48,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,539 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:03:48,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:03:48,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:03:48,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:03:48,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:03:48,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (1/1) ... [2024-10-24 22:03:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:03:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:03:48,606 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-10-24 22:03:48,620 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-10-24 22:03:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:03:48,708 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:03:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-24 22:03:48,708 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-24 22:03:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:03:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:03:48,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:03:48,899 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:03:48,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:03:49,122 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-24 22:03:49,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:03:49,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:03:49,144 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:03:49,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:49 BoogieIcfgContainer [2024-10-24 22:03:49,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:03:49,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:03:49,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:03:49,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:03:49,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:03:47" (1/3) ... [2024-10-24 22:03:49,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7951d87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:49, skipping insertion in model container [2024-10-24 22:03:49,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:48" (2/3) ... [2024-10-24 22:03:49,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7951d87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:49, skipping insertion in model container [2024-10-24 22:03:49,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:49" (3/3) ... [2024-10-24 22:03:49,159 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:49,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:03:49,174 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:03:49,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:03:49,248 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;@53cb9040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:03:49,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:03:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 36 states have (on average 1.5) internal successors, (54), 38 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 22:03:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 22:03:49,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:49,261 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:49,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1106863049, now seen corresponding path program 1 times [2024-10-24 22:03:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:03:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50640038] [2024-10-24 22:03:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:03:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:49,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:03:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:03:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 22:03:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 22:03:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:03:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50640038] [2024-10-24 22:03:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50640038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 22:03:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074252942] [2024-10-24 22:03:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 22:03:49,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:03:49,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 22:03:49,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 22:03:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:49,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:03:49,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:03:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 22:03:49,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:03:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074252942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 22:03:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-24 22:03:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984726261] [2024-10-24 22:03:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:03:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:03:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:03:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 22:03:49,833 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.5) internal successors, (54), 38 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:49,870 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-10-24 22:03:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:03:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-10-24 22:03:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:49,881 INFO L225 Difference]: With dead ends: 52 [2024-10-24 22:03:49,882 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 22:03:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 22:03:49,889 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:49,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:03:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 22:03:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-24 22:03:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 22:03:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-10-24 22:03:49,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 18 [2024-10-24 22:03:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:49,932 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-10-24 22:03:49,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-10-24 22:03:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 22:03:49,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:49,936 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:49,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 22:03:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 22:03:50,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 46983987, now seen corresponding path program 1 times [2024-10-24 22:03:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:03:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243582139] [2024-10-24 22:03:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:03:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:03:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:03:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 22:03:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 22:03:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:03:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243582139] [2024-10-24 22:03:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243582139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 22:03:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712205641] [2024-10-24 22:03:50,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:50,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 22:03:50,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:03:50,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 22:03:50,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 22:03:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:03:50,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:03:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 22:03:50,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:03:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712205641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 22:03:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-24 22:03:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282717217] [2024-10-24 22:03:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:03:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:03:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:03:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 22:03:50,419 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:50,441 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-10-24 22:03:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:03:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-24 22:03:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:50,443 INFO L225 Difference]: With dead ends: 47 [2024-10-24 22:03:50,443 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 22:03:50,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 22:03:50,445 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:50,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:03:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 22:03:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 22:03:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 22:03:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-24 22:03:50,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 19 [2024-10-24 22:03:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-24 22:03:50,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-24 22:03:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 22:03:50,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:50,454 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:50,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 22:03:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 22:03:50,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -274291436, now seen corresponding path program 1 times [2024-10-24 22:03:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:03:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995205133] [2024-10-24 22:03:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:03:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:03:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:03:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 22:03:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 22:03:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:03:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995205133] [2024-10-24 22:03:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995205133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:03:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 22:03:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172082511] [2024-10-24 22:03:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 22:03:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:03:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 22:03:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 22:03:50,930 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:51,034 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-10-24 22:03:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 22:03:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-24 22:03:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:51,035 INFO L225 Difference]: With dead ends: 49 [2024-10-24 22:03:51,036 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 22:03:51,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 22:03:51,037 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 41 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:51,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 22:03:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 22:03:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-24 22:03:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 22:03:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-10-24 22:03:51,045 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 24 [2024-10-24 22:03:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-10-24 22:03:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-10-24 22:03:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 22:03:51,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:51,047 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 22:03:51,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -562845778, now seen corresponding path program 1 times [2024-10-24 22:03:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:03:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728598613] [2024-10-24 22:03:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:03:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:03:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:03:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 22:03:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 22:03:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:03:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728598613] [2024-10-24 22:03:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728598613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:03:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:03:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369051108] [2024-10-24 22:03:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:03:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:03:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:03:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:03:51,169 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:51,188 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-10-24 22:03:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:03:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-24 22:03:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:51,190 INFO L225 Difference]: With dead ends: 47 [2024-10-24 22:03:51,191 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 22:03:51,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-24 22:03:51,192 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:51,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:03:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 22:03:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-10-24 22:03:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 22:03:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-10-24 22:03:51,204 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 24 [2024-10-24 22:03:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:51,205 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-10-24 22:03:51,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-10-24 22:03:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 22:03:51,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:51,207 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:51,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 22:03:51,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 86900214, now seen corresponding path program 1 times [2024-10-24 22:03:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:03:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542953697] [2024-10-24 22:03:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:03:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:03:51,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:03:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:03:51,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 22:03:51,269 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:03:51,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:03:51,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:03:51,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 22:03:51,275 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 22:03:51,309 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:03:51,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:03:51 BoogieIcfgContainer [2024-10-24 22:03:51,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:03:51,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:03:51,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:03:51,315 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:03:51,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:49" (3/4) ... [2024-10-24 22:03:51,318 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:03:51,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:03:51,320 INFO L158 Benchmark]: Toolchain (without parser) took 3799.70ms. Allocated memory is still 165.7MB. Free memory was 116.5MB in the beginning and 80.1MB in the end (delta: 36.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,321 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:03:51,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 923.09ms. Allocated memory is still 165.7MB. Free memory was 116.5MB in the beginning and 55.1MB in the end (delta: 61.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.14ms. Allocated memory is still 165.7MB. Free memory was 55.1MB in the beginning and 51.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,322 INFO L158 Benchmark]: Boogie Preprocessor took 44.07ms. Allocated memory is still 165.7MB. Free memory was 51.5MB in the beginning and 49.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,323 INFO L158 Benchmark]: RCFGBuilder took 584.54ms. Allocated memory is still 165.7MB. Free memory was 49.4MB in the beginning and 119.2MB in the end (delta: -69.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,324 INFO L158 Benchmark]: TraceAbstraction took 2162.49ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 80.1MB in the end (delta: 38.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-10-24 22:03:51,324 INFO L158 Benchmark]: Witness Printer took 6.47ms. Allocated memory is still 165.7MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:03:51,325 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.16ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 923.09ms. Allocated memory is still 165.7MB. Free memory was 116.5MB in the beginning and 55.1MB in the end (delta: 61.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.14ms. Allocated memory is still 165.7MB. Free memory was 55.1MB in the beginning and 51.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.07ms. Allocated memory is still 165.7MB. Free memory was 51.5MB in the beginning and 49.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 584.54ms. Allocated memory is still 165.7MB. Free memory was 49.4MB in the beginning and 119.2MB in the end (delta: -69.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2162.49ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 80.1MB in the end (delta: 38.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 6.47ms. Allocated memory is still 165.7MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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 3 procedures, 45 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 211 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 10/12 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:03:51,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:03:53,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:03:53,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 22:03:53,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:03:53,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:03:53,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 22:03:53,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:03:53,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:03:53,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:03:53,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:03:53,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:03:53,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:03:53,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:03:53,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:03:53,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:03:53,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:03:53,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:03:53,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:03:53,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:03:53,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:03:53,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:03:53,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:03:53,677 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 22:03:53,678 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 22:03:53,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:03:53,678 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:03:53,679 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 22:03:53,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:03:53,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:03:53,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:03:53,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:03:53,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:03:53,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:03:53,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:03:53,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:03:53,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:03:53,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:03:53,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:03:53,682 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 22:03:53,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 22:03:53,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:03:53,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:03:53,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:03:53,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:03:53,684 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 22:03:53,684 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 [2024-10-24 22:03:53,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:03:54,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:03:54,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:03:54,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:03:54,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:03:54,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:55,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:03:55,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:03:55,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:55,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5610c62d2/1c409f1aec844a1b83b7607beea9a4c0/FLAG948068454 [2024-10-24 22:03:55,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5610c62d2/1c409f1aec844a1b83b7607beea9a4c0 [2024-10-24 22:03:55,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:03:55,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:03:55,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:03:55,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:03:55,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:03:55,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:55" (1/1) ... [2024-10-24 22:03:55,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231eb6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:55, skipping insertion in model container [2024-10-24 22:03:55,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:55" (1/1) ... [2024-10-24 22:03:56,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:03:56,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:03:56,737 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:03:56,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:03:57,009 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:03:57,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57 WrapperNode [2024-10-24 22:03:57,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:03:57,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:03:57,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:03:57,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:03:57,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,059 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-10-24 22:03:57,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:03:57,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:03:57,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:03:57,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:03:57,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,086 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:03:57,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:03:57,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:03:57,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:03:57,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:03:57,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (1/1) ... [2024-10-24 22:03:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:03:57,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:03:57,147 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-10-24 22:03:57,154 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-10-24 22:03:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:03:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:03:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-24 22:03:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-24 22:03:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:03:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:03:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:03:57,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:03:57,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:03:57,433 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 22:03:57,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:03:57,462 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:03:57,462 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:03:57,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:57 BoogieIcfgContainer [2024-10-24 22:03:57,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:03:57,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:03:57,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:03:57,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:03:57,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:03:55" (1/3) ... [2024-10-24 22:03:57,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:57, skipping insertion in model container [2024-10-24 22:03:57,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:57" (2/3) ... [2024-10-24 22:03:57,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:57, skipping insertion in model container [2024-10-24 22:03:57,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:57" (3/3) ... [2024-10-24 22:03:57,468 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-24 22:03:57,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:03:57,496 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 22:03:57,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:03:57,549 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;@2b966b06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:03:57,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 22:03:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 22:03:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:03:57,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:57,562 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:57,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:57,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1569213815, now seen corresponding path program 1 times [2024-10-24 22:03:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:03:57,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654295845] [2024-10-24 22:03:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:03:57,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:03:57,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 22:03:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:57,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 22:03:57,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:03:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 22:03:57,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:03:57,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:03:57,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654295845] [2024-10-24 22:03:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654295845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:03:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 22:03:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571729338] [2024-10-24 22:03:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:57,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 22:03:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:03:57,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 22:03:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 22:03:57,940 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 22:03:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:57,974 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-24 22:03:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 22:03:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2024-10-24 22:03:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:57,985 INFO L225 Difference]: With dead ends: 23 [2024-10-24 22:03:57,986 INFO L226 Difference]: Without dead ends: 18 [2024-10-24 22:03:57,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 22:03:57,992 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:57,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:03:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-24 22:03:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-24 22:03:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 22:03:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-24 22:03:58,032 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2024-10-24 22:03:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:58,033 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-24 22:03:58,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 22:03:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-24 22:03:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 22:03:58,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:58,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:58,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 22:03:58,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:58,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1400988073, now seen corresponding path program 1 times [2024-10-24 22:03:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:03:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034014743] [2024-10-24 22:03:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:58,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:03:58,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:03:58,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 22:03:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:03:58,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 22:03:58,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:03:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:03:58,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:03:58,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:03:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034014743] [2024-10-24 22:03:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034014743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:03:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:03:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 22:03:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637155712] [2024-10-24 22:03:58,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:03:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 22:03:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:03:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 22:03:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 22:03:58,420 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:03:58,439 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-24 22:03:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 22:03:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-10-24 22:03:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:03:58,441 INFO L225 Difference]: With dead ends: 25 [2024-10-24 22:03:58,441 INFO L226 Difference]: Without dead ends: 18 [2024-10-24 22:03:58,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 22:03:58,443 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:03:58,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:03:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-24 22:03:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-24 22:03:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 22:03:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-24 22:03:58,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2024-10-24 22:03:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:03:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-24 22:03:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 22:03:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-24 22:03:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 22:03:58,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:03:58,451 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:03:58,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 22:03:58,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:58,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 22:03:58,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:03:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 955631684, now seen corresponding path program 1 times [2024-10-24 22:03:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:03:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146723321] [2024-10-24 22:03:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:03:58,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:03:58,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 22:03:58,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 22:03:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:03:58,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:03:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:03:58,795 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 22:03:58,795 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:03:58,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 22:03:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 22:03:58,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 22:03:58,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 22:03:59,002 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 22:03:59,035 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:03:59,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:03:59 BoogieIcfgContainer [2024-10-24 22:03:59,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:03:59,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:03:59,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:03:59,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:03:59,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:57" (3/4) ... [2024-10-24 22:03:59,046 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:03:59,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:03:59,048 INFO L158 Benchmark]: Toolchain (without parser) took 3062.00ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 35.5MB in the beginning and 42.6MB in the end (delta: -7.0MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-10-24 22:03:59,048 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:03:59,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1021.73ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 30.1MB in the end (delta: 5.2MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-10-24 22:03:59,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.86ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 27.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:03:59,049 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 43.5MB in the end (delta: -16.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:03:59,050 INFO L158 Benchmark]: RCFGBuilder took 357.91ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 27.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 22:03:59,050 INFO L158 Benchmark]: TraceAbstraction took 1576.77ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 26.7MB in the beginning and 43.2MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:03:59,050 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 86.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:03:59,057 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.28ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1021.73ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.3MB in the beginning and 30.1MB in the end (delta: 5.2MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.86ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 27.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 43.5MB in the end (delta: -16.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.91ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 27.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1576.77ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 26.7MB in the beginning and 43.2MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 86.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: 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 3 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 0 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 22:03:59,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample