./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_preinc_12_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_preinc_12_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 91e50674a48bedd27c81b39262ef0cb7a6dd1d01dd365f94c44bbc9f6cdc61fa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:07:17,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:07:17,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 22:07:17,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:07:17,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:07:17,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:07:17,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:07:17,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:07:17,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:07:17,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:07:17,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:07:17,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:07:17,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:07:17,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:07:17,942 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:07:17,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:07:17,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:07:17,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 22:07:17,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:07:17,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:07:17,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:07:17,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:07:17,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:07:17,948 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:07:17,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:07:17,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:07:17,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:07:17,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:07:17,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:07:17,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:07:17,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:07:17,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:07:17,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:07:17,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:07:17,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:07:17,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 22:07:17,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 22:07:17,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:07:17,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:07:17,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:07:17,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:07:17,954 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 -> 91e50674a48bedd27c81b39262ef0cb7a6dd1d01dd365f94c44bbc9f6cdc61fa [2024-10-24 22:07:18,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:07:18,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:07:18,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:07:18,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:07:18,230 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:07:18,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:19,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:07:20,011 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:07:20,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:20,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978dc854e/0495b4238c36401eb00869c79dce50db/FLAGe2bbb5140 [2024-10-24 22:07:20,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978dc854e/0495b4238c36401eb00869c79dce50db [2024-10-24 22:07:20,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:07:20,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:07:20,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:07:20,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:07:20,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:07:20,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:20" (1/1) ... [2024-10-24 22:07:20,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2404cc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:20, skipping insertion in model container [2024-10-24 22:07:20,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:20" (1/1) ... [2024-10-24 22:07:20,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:07:21,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:07:21,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:07:21,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:07:21,372 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:07:21,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21 WrapperNode [2024-10-24 22:07:21,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:07:21,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:07:21,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:07:21,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:07:21,382 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:07:21" (1/1) ... [2024-10-24 22:07:21,411 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:07:21" (1/1) ... [2024-10-24 22:07:21,448 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-10-24 22:07:21,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:07:21,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:07:21,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:07:21,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:07:21,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,491 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:07:21,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:07:21,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:07:21,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:07:21,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:07:21,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (1/1) ... [2024-10-24 22:07:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:07:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:07:21,547 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:07:21,549 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:07:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 22:07:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 22:07:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 22:07:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 22:07:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:07:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:07:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:07:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:07:21,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:07:21,718 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:07:21,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:07:21,977 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-10-24 22:07:21,977 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:07:22,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:07:22,006 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:07:22,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:22 BoogieIcfgContainer [2024-10-24 22:07:22,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:07:22,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:07:22,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:07:22,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:07:22,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:07:20" (1/3) ... [2024-10-24 22:07:22,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de771dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:22, skipping insertion in model container [2024-10-24 22:07:22,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:21" (2/3) ... [2024-10-24 22:07:22,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de771dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:22, skipping insertion in model container [2024-10-24 22:07:22,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:22" (3/3) ... [2024-10-24 22:07:22,020 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:22,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:07:22,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 22:07:22,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:07:22,104 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;@1c254db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:07:22,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 22:07:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 47 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 22:07:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 22:07:22,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:22,120 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:07:22,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1527888929, now seen corresponding path program 1 times [2024-10-24 22:07:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:07:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822540056] [2024-10-24 22:07:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:07:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:07:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:07:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 22:07:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,525 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:07:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:07:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822540056] [2024-10-24 22:07:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822540056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:07:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:07:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:07:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444276153] [2024-10-24 22:07:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:07:22,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:07:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:07:22,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:07:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:07:22,567 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 47 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 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:07:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:07:22,649 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-10-24 22:07:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:07:22,652 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:07:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:07:22,660 INFO L225 Difference]: With dead ends: 80 [2024-10-24 22:07:22,661 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 22:07:22,664 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:07:22,667 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 22:07:22,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 22:07:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 22:07:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 22:07:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 40 states have internal predecessors, (54), 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:07:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-10-24 22:07:22,702 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2024-10-24 22:07:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:07:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-10-24 22:07:22,705 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:07:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-10-24 22:07:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 22:07:22,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:22,709 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:07:22,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 22:07:22,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348604, now seen corresponding path program 1 times [2024-10-24 22:07:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:07:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139907332] [2024-10-24 22:07:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:07:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:07:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 22:07:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 22:07:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:22,952 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:07:22,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:07:22,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139907332] [2024-10-24 22:07:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139907332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:07:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:07:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:07:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304602497] [2024-10-24 22:07:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:07:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:07:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:07:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:07:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:07:22,958 INFO L87 Difference]: Start difference. First operand 46 states and 60 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:07:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:07:22,984 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-10-24 22:07:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:07:22,985 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:07:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:07:22,986 INFO L225 Difference]: With dead ends: 46 [2024-10-24 22:07:22,986 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 22:07:22,988 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:07:22,989 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:07:22,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:07:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 22:07:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 22:07:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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:07:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-10-24 22:07:23,001 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 24 [2024-10-24 22:07:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:07:23,002 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-10-24 22:07:23,002 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:07:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2024-10-24 22:07:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 22:07:23,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:23,005 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:07:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 22:07:23,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 441232018, now seen corresponding path program 1 times [2024-10-24 22:07:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:07:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820622175] [2024-10-24 22:07:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:07:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:07:23,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:07:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:07:23,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 22:07:23,108 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:07:23,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 22:07:23,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 22:07:23,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 22:07:23,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 22:07:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 22:07:23,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 22:07:23,154 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:07:23,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:07:23 BoogieIcfgContainer [2024-10-24 22:07:23,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:07:23,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:07:23,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:07:23,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:07:23,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:22" (3/4) ... [2024-10-24 22:07:23,167 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:07:23,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:07:23,169 INFO L158 Benchmark]: Toolchain (without parser) took 2908.22ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 78.7MB in the end (delta: 30.6MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,170 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:07:23,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1110.29ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 98.1MB in the end (delta: 10.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.85ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,171 INFO L158 Benchmark]: Boogie Preprocessor took 56.21ms. Allocated memory is still 180.4MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,171 INFO L158 Benchmark]: RCFGBuilder took 500.40ms. Allocated memory is still 180.4MB. Free memory was 92.4MB in the beginning and 145.8MB in the end (delta: -53.4MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,171 INFO L158 Benchmark]: TraceAbstraction took 1149.79ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 78.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-24 22:07:23,172 INFO L158 Benchmark]: Witness Printer took 8.35ms. Allocated memory is still 180.4MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:07:23,174 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.17ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1110.29ms. Allocated memory is still 180.4MB. Free memory was 109.0MB in the beginning and 98.1MB in the end (delta: 10.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.85ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 95.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.21ms. Allocated memory is still 180.4MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.40ms. Allocated memory is still 180.4MB. Free memory was 92.4MB in the beginning and 145.8MB in the end (delta: -53.4MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1149.79ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 78.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 8.35ms. Allocated memory is still 180.4MB. Free memory is still 78.7MB. 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: 1563]: 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 1585. 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); [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE190_Integer_Overflow__int_rand_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [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, 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, 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, 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)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] ++data 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: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 58 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 129 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.4s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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:07:23,211 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_preinc_12_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 91e50674a48bedd27c81b39262ef0cb7a6dd1d01dd365f94c44bbc9f6cdc61fa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:07:25,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:07:25,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 22:07:25,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:07:25,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:07:25,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 22:07:25,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:07:25,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:07:25,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:07:25,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:07:25,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:07:25,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:07:25,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:07:25,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:07:25,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:07:25,775 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:07:25,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:07:25,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:07:25,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:07:25,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:07:25,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:07:25,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:07:25,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 22:07:25,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 22:07:25,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:07:25,782 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:07:25,783 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 22:07:25,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:07:25,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:07:25,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:07:25,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:07:25,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:07:25,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:07:25,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:07:25,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:07:25,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:07:25,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:07:25,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:07:25,793 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 22:07:25,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 22:07:25,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:07:25,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:07:25,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:07:25,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:07:25,797 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 22:07:25,797 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 -> 91e50674a48bedd27c81b39262ef0cb7a6dd1d01dd365f94c44bbc9f6cdc61fa [2024-10-24 22:07:26,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:07:26,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:07:26,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:07:26,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:07:26,157 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:07:26,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:27,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:07:28,134 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:07:28,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:28,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823f3b6aa/b64805c0d0374266b6c8c90b1cd7decc/FLAG00dd5dc52 [2024-10-24 22:07:28,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823f3b6aa/b64805c0d0374266b6c8c90b1cd7decc [2024-10-24 22:07:28,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:07:28,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:07:28,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:07:28,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:07:28,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:07:28,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:28" (1/1) ... [2024-10-24 22:07:28,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6e649b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:28, skipping insertion in model container [2024-10-24 22:07:28,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:07:28" (1/1) ... [2024-10-24 22:07:28,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:07:29,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:07:29,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:07:29,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:07:29,327 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:07:29,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29 WrapperNode [2024-10-24 22:07:29,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:07:29,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:07:29,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:07:29,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:07:29,336 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:07:29" (1/1) ... [2024-10-24 22:07:29,373 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:07:29" (1/1) ... [2024-10-24 22:07:29,403 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-24 22:07:29,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:07:29,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:07:29,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:07:29,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:07:29,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,449 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:07:29,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:07:29,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:07:29,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:07:29,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:07:29,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (1/1) ... [2024-10-24 22:07:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:07:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:07:29,516 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:07:29,519 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:07:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-24 22:07:29,567 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-24 22:07:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-24 22:07:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-24 22:07:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:07:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:07:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:07:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:07:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:07:29,737 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:07:29,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:07:29,936 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-24 22:07:29,936 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:07:29,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:07:29,978 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 22:07:29,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:29 BoogieIcfgContainer [2024-10-24 22:07:29,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:07:29,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:07:29,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:07:29,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:07:29,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:07:28" (1/3) ... [2024-10-24 22:07:29,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348f7948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:29, skipping insertion in model container [2024-10-24 22:07:29,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:07:29" (2/3) ... [2024-10-24 22:07:29,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348f7948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:07:29, skipping insertion in model container [2024-10-24 22:07:29,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:29" (3/3) ... [2024-10-24 22:07:29,989 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_12_bad.i [2024-10-24 22:07:30,008 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:07:30,008 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-24 22:07:30,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:07:30,084 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;@6021b69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:07:30,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 22:07:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 22:07:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 22:07:30,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:30,097 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:07:30,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:30,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 657284848, now seen corresponding path program 1 times [2024-10-24 22:07:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:07:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730000318] [2024-10-24 22:07:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:30,120 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:07:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:07:30,124 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:07:30,125 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:07:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:30,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 22:07:30,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:07:30,260 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:07:30,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:07:30,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:07:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730000318] [2024-10-24 22:07:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730000318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:07:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:07:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 22:07:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243935233] [2024-10-24 22:07:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:07:30,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 22:07:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:07:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 22:07:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 22:07:30,298 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 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:07:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:07:30,328 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-24 22:07:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 22:07:30,331 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:07:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:07:30,338 INFO L225 Difference]: With dead ends: 36 [2024-10-24 22:07:30,338 INFO L226 Difference]: Without dead ends: 22 [2024-10-24 22:07:30,342 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:07:30,346 INFO L432 NwaCegarLoop]: 38 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, 38 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:07:30,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:07:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-24 22:07:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-24 22:07:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:07:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-24 22:07:30,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-10-24 22:07:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:07:30,402 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-24 22:07:30,402 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:07:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-24 22:07:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 22:07:30,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:30,403 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:07:30,409 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 (2)] Ended with exit code 0 [2024-10-24 22:07:30,603 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:07:30,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:30,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1099006124, now seen corresponding path program 1 times [2024-10-24 22:07:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:07:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121549875] [2024-10-24 22:07:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:30,605 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:07:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:07:30,610 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:07:30,611 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:07:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:07:30,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:07:30,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:07:30,740 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:07:30,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:07:30,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:07:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121549875] [2024-10-24 22:07:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121549875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:07:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:07:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:07:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485807240] [2024-10-24 22:07:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:07:30,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:07:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:07:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:07:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:07:30,747 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:07:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:07:30,780 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-24 22:07:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:07:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2024-10-24 22:07:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:07:30,781 INFO L225 Difference]: With dead ends: 31 [2024-10-24 22:07:30,781 INFO L226 Difference]: Without dead ends: 22 [2024-10-24 22:07:30,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:07:30,784 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:07:30,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:07:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-24 22:07:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-24 22:07:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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:07:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-24 22:07:30,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2024-10-24 22:07:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:07:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-24 22:07:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:07:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-24 22:07:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 22:07:30,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:07:30,794 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:07:30,798 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:07:30,994 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:07:30,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-24 22:07:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:07:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1283430033, now seen corresponding path program 1 times [2024-10-24 22:07:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:07:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756394790] [2024-10-24 22:07:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:07:31,001 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:07:31,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:07:31,004 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:07:31,008 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:07:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:07:31,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:07:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:07:31,135 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 22:07:31,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:07:31,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-24 22:07:31,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-24 22:07:31,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-24 22:07:31,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-24 22:07:31,146 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:07:31,344 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:07:31,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 22:07:31,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:07:31,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:07:31 BoogieIcfgContainer [2024-10-24 22:07:31,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:07:31,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:07:31,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:07:31,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:07:31,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:07:29" (3/4) ... [2024-10-24 22:07:31,387 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:07:31,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:07:31,390 INFO L158 Benchmark]: Toolchain (without parser) took 3211.34ms. Allocated memory was 58.7MB in the beginning and 88.1MB in the end (delta: 29.4MB). Free memory was 33.3MB in the beginning and 36.0MB in the end (delta: -2.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,390 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:07:31,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1148.72ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.61ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 27.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,394 INFO L158 Benchmark]: Boogie Preprocessor took 73.58ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 41.8MB in the end (delta: -13.9MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,394 INFO L158 Benchmark]: RCFGBuilder took 500.71ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 41.8MB in the beginning and 55.6MB in the end (delta: -13.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,395 INFO L158 Benchmark]: TraceAbstraction took 1402.43ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 36.0MB in the end (delta: 19.1MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-24 22:07:31,395 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 88.1MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:07:31,397 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.13ms. Allocated memory is still 48.2MB. Free memory was 23.2MB in the beginning and 23.1MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1148.72ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.61ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 27.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.58ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 41.8MB in the end (delta: -13.9MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * RCFGBuilder took 500.71ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 41.8MB in the beginning and 55.6MB in the end (delta: -13.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1402.43ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 36.0MB in the end (delta: 19.1MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 88.1MB. Free memory is still 36.0MB. 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: 1563]: 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 1585. 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); [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE190_Integer_Overflow__int_rand_preinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [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, 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)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] ++data 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: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 58 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 3 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:07:31,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample