./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 01:15:32,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 01:15:32,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-23 01:15:32,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 01:15:32,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 01:15:32,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 01:15:32,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 01:15:32,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 01:15:32,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 01:15:32,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 01:15:32,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 01:15:32,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 01:15:32,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 01:15:32,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 01:15:32,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 01:15:32,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 01:15:32,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 01:15:32,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 01:15:32,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 01:15:32,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 01:15:32,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 01:15:32,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 01:15:32,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 01:15:32,766 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 01:15:32,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 01:15:32,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 01:15:32,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 01:15:32,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 01:15:32,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 01:15:32,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 01:15:32,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 01:15:32,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:15:32,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 01:15:32,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 01:15:32,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 01:15:32,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 01:15:32,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 01:15:32,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 01:15:32,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 01:15:32,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 01:15:32,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 01:15:32,773 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 -> 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 [2024-11-23 01:15:33,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 01:15:33,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 01:15:33,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 01:15:33,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 01:15:33,049 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 01:15:33,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:34,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 01:15:34,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 01:15:34,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:34,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf20e057/354ae758d4014a7cb9147a6a6d22f92f/FLAG4b4260f54 [2024-11-23 01:15:35,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf20e057/354ae758d4014a7cb9147a6a6d22f92f [2024-11-23 01:15:35,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 01:15:35,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 01:15:35,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 01:15:35,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 01:15:35,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 01:15:35,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:35" (1/1) ... [2024-11-23 01:15:35,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701028e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:35, skipping insertion in model container [2024-11-23 01:15:35,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:35" (1/1) ... [2024-11-23 01:15:35,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 01:15:36,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:15:36,109 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 01:15:36,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:15:36,412 INFO L204 MainTranslator]: Completed translation [2024-11-23 01:15:36,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36 WrapperNode [2024-11-23 01:15:36,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 01:15:36,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 01:15:36,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 01:15:36,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 01:15:36,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,489 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-23 01:15:36,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 01:15:36,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 01:15:36,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 01:15:36,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 01:15:36,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,517 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 01:15:36,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 01:15:36,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 01:15:36,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 01:15:36,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 01:15:36,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (1/1) ... [2024-11-23 01:15:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:15:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:15:36,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 01:15:36,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 01:15:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 01:15:36,609 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 01:15:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-23 01:15:36,610 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-23 01:15:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 01:15:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 01:15:36,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 01:15:36,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 01:15:36,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 01:15:36,995 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-23 01:15:36,995 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 01:15:37,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 01:15:37,007 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 01:15:37,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:37 BoogieIcfgContainer [2024-11-23 01:15:37,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 01:15:37,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 01:15:37,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 01:15:37,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 01:15:37,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:15:35" (1/3) ... [2024-11-23 01:15:37,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac59247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:37, skipping insertion in model container [2024-11-23 01:15:37,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:36" (2/3) ... [2024-11-23 01:15:37,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac59247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:37, skipping insertion in model container [2024-11-23 01:15:37,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:37" (3/3) ... [2024-11-23 01:15:37,015 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:37,027 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 01:15:37,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-23 01:15:37,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 01:15:37,078 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;@44495ee9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 01:15:37,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 01:15:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 01:15:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-23 01:15:37,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:37,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:15:37,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1648115636, now seen corresponding path program 1 times [2024-11-23 01:15:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:15:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960613810] [2024-11-23 01:15:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:15:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 01:15:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:15:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960613810] [2024-11-23 01:15:37,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960613810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:15:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819434908] [2024-11-23 01:15:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:37,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:15:37,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:15:37,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:15:37,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 01:15:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:37,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:15:37,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:15:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 01:15:37,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:15:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819434908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:15:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:15:37,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-23 01:15:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705819857] [2024-11-23 01:15:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:15:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:15:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:15:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:15:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:15:37,528 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-23 01:15:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:15:37,555 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-23 01:15:37,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:15:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 21 [2024-11-23 01:15:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:15:37,562 INFO L225 Difference]: With dead ends: 57 [2024-11-23 01:15:37,562 INFO L226 Difference]: Without dead ends: 48 [2024-11-23 01:15:37,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:15:37,568 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:15:37,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:15:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-23 01:15:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-23 01:15:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 01:15:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-23 01:15:37,597 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-23 01:15:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:15:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-23 01:15:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-23 01:15:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-23 01:15:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-23 01:15:37,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:37,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:15:37,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 01:15:37,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-23 01:15:37,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:37,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash -448022698, now seen corresponding path program 1 times [2024-11-23 01:15:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:15:37,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838843464] [2024-11-23 01:15:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:15:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 01:15:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:15:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838843464] [2024-11-23 01:15:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838843464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:15:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734541965] [2024-11-23 01:15:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:37,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:15:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:15:37,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:15:37,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 01:15:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:37,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:15:37,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:15:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 01:15:38,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:15:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734541965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:15:38,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:15:38,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-23 01:15:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539977907] [2024-11-23 01:15:38,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:15:38,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:15:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:15:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:15:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:15:38,020 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-11-23 01:15:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:15:38,037 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-23 01:15:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:15:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2024-11-23 01:15:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:15:38,038 INFO L225 Difference]: With dead ends: 49 [2024-11-23 01:15:38,039 INFO L226 Difference]: Without dead ends: 43 [2024-11-23 01:15:38,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:15:38,040 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:15:38,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:15:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-23 01:15:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-23 01:15:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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-11-23 01:15:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-23 01:15:38,050 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-23 01:15:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:15:38,051 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-23 01:15:38,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-11-23 01:15:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-23 01:15:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 01:15:38,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:38,053 INFO L215 NwaCegarLoop]: trace histogram [2, 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-11-23 01:15:38,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-23 01:15:38,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-23 01:15:38,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash 10447351, now seen corresponding path program 1 times [2024-11-23 01:15:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:15:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944319118] [2024-11-23 01:15:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:15:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 01:15:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:15:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944319118] [2024-11-23 01:15:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944319118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:15:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:15:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:15:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664194942] [2024-11-23 01:15:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:15:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:15:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:15:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:15:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:15:38,633 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-23 01:15:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:15:38,771 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-23 01:15:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:15:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 27 [2024-11-23 01:15:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:15:38,772 INFO L225 Difference]: With dead ends: 51 [2024-11-23 01:15:38,773 INFO L226 Difference]: Without dead ends: 50 [2024-11-23 01:15:38,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-23 01:15:38,774 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:15:38,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:15:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-23 01:15:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-23 01:15:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 01:15:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-23 01:15:38,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 27 [2024-11-23 01:15:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:15:38,793 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-23 01:15:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-23 01:15:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-23 01:15:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-23 01:15:38,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:38,798 INFO L215 NwaCegarLoop]: trace histogram [2, 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-11-23 01:15:38,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 01:15:38,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash -344802659, now seen corresponding path program 1 times [2024-11-23 01:15:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:15:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132580274] [2024-11-23 01:15:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:15:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:15:38,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 01:15:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:15:38,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 01:15:38,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 01:15:38,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-23 01:15:38,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-23 01:15:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 01:15:38,941 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-23 01:15:39,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 01:15:39,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:15:39 BoogieIcfgContainer [2024-11-23 01:15:39,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 01:15:39,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 01:15:39,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 01:15:39,016 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 01:15:39,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:37" (3/4) ... [2024-11-23 01:15:39,024 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 01:15:39,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 01:15:39,026 INFO L158 Benchmark]: Toolchain (without parser) took 4003.96ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 105.5MB in the beginning and 147.4MB in the end (delta: -41.9MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,026 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 96.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 01:15:39,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1392.85ms. Allocated memory is still 161.5MB. Free memory was 105.2MB in the beginning and 75.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.12ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,029 INFO L158 Benchmark]: Boogie Preprocessor took 41.20ms. Allocated memory is still 161.5MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,030 INFO L158 Benchmark]: RCFGBuilder took 475.25ms. Allocated memory is still 161.5MB. Free memory was 70.3MB in the beginning and 125.0MB in the end (delta: -54.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,030 INFO L158 Benchmark]: TraceAbstraction took 2002.92ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 124.0MB in the beginning and 147.4MB in the end (delta: -23.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-23 01:15:39,034 INFO L158 Benchmark]: Witness Printer took 12.82ms. Allocated memory is still 205.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 01:15:39,036 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 96.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1392.85ms. Allocated memory is still 161.5MB. Free memory was 105.2MB in the beginning and 75.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.12ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.20ms. Allocated memory is still 161.5MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.25ms. Allocated memory is still 161.5MB. Free memory was 70.3MB in the beginning and 125.0MB in the end (delta: -54.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2002.92ms. Allocated memory was 161.5MB in the beginning and 205.5MB in the end (delta: 44.0MB). Free memory was 124.0MB in the beginning and 147.4MB in the end (delta: -23.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Witness Printer took 12.82ms. Allocated memory is still 205.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE191_Integer_Underflow__int_rand_sub_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 177 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 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-11-23 01:15:39,072 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 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 ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 01:15:41,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 01:15:42,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-23 01:15:42,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 01:15:42,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 01:15:42,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-23 01:15:42,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 01:15:42,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 01:15:42,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 01:15:42,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 01:15:42,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 01:15:42,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 01:15:42,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 01:15:42,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 01:15:42,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 01:15:42,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 01:15:42,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 01:15:42,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 01:15:42,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 01:15:42,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 01:15:42,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 01:15:42,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 01:15:42,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 01:15:42,057 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 01:15:42,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 01:15:42,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 01:15:42,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 01:15:42,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 01:15:42,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 01:15:42,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 01:15:42,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 01:15:42,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 01:15:42,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 01:15:42,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 01:15:42,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:15:42,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 01:15:42,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 01:15:42,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 01:15:42,065 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-23 01:15:42,065 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 01:15:42,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 01:15:42,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 01:15:42,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 01:15:42,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 01:15:42,067 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 -> 2d42bc4029b22d5fbac4ec556f66bb794bd4efb484b2f7343472d3031f33fa34 [2024-11-23 01:15:42,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 01:15:42,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 01:15:42,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 01:15:42,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 01:15:42,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 01:15:42,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:44,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 01:15:44,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 01:15:44,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:44,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e2566ff/bb5cef9b9ab14cdf8815bdef8e49902c/FLAG3eb7f397f [2024-11-23 01:15:44,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e2566ff/bb5cef9b9ab14cdf8815bdef8e49902c [2024-11-23 01:15:44,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 01:15:44,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 01:15:44,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 01:15:44,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 01:15:44,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 01:15:44,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:44" (1/1) ... [2024-11-23 01:15:44,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6798eb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:44, skipping insertion in model container [2024-11-23 01:15:44,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:44" (1/1) ... [2024-11-23 01:15:44,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 01:15:45,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:15:45,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 01:15:45,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:15:46,061 INFO L204 MainTranslator]: Completed translation [2024-11-23 01:15:46,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46 WrapperNode [2024-11-23 01:15:46,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 01:15:46,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 01:15:46,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 01:15:46,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 01:15:46,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,123 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-23 01:15:46,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 01:15:46,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 01:15:46,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 01:15:46,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 01:15:46,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,155 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 01:15:46,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 01:15:46,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 01:15:46,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 01:15:46,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 01:15:46,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (1/1) ... [2024-11-23 01:15:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:15:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:15:46,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 01:15:46,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 01:15:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 01:15:46,287 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 01:15:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-11-23 01:15:46,287 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-11-23 01:15:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 01:15:46,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 01:15:46,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 01:15:46,513 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 01:15:46,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 01:15:46,709 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-23 01:15:46,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 01:15:46,731 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 01:15:46,736 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 01:15:46,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:46 BoogieIcfgContainer [2024-11-23 01:15:46,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 01:15:46,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 01:15:46,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 01:15:46,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 01:15:46,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:15:44" (1/3) ... [2024-11-23 01:15:46,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d9ebe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:46, skipping insertion in model container [2024-11-23 01:15:46,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:46" (2/3) ... [2024-11-23 01:15:46,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d9ebe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:46, skipping insertion in model container [2024-11-23 01:15:46,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:46" (3/3) ... [2024-11-23 01:15:46,747 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_11_bad.i [2024-11-23 01:15:46,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 01:15:46,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-23 01:15:46,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 01:15:46,822 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;@146f0faf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 01:15:46,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 01:15:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 01:15:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-23 01:15:46,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:46,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:15:46,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash -894708504, now seen corresponding path program 1 times [2024-11-23 01:15:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:15:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639784721] [2024-11-23 01:15:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:46,848 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-11-23 01:15:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:15:46,851 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-11-23 01:15:46,862 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-11-23 01:15:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:15:46,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:15:46,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:15:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:15:47,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:15:47,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:15:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639784721] [2024-11-23 01:15:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639784721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:15:47,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:15:47,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 01:15:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291009693] [2024-11-23 01:15:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:15:47,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:15:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:15:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:15:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 01:15:47,069 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:15:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:15:47,094 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-23 01:15:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:15:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-23 01:15:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:15:47,101 INFO L225 Difference]: With dead ends: 47 [2024-11-23 01:15:47,101 INFO L226 Difference]: Without dead ends: 19 [2024-11-23 01:15:47,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 01:15:47,107 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:15:47,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:15:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-23 01:15:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-23 01:15:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:15:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-23 01:15:47,134 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 19 [2024-11-23 01:15:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:15:47,135 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-23 01:15:47,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:15:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-23 01:15:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-23 01:15:47,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:15:47,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:15:47,142 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-11-23 01:15:47,337 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-11-23 01:15:47,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 01:15:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:15:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2082070403, now seen corresponding path program 1 times [2024-11-23 01:15:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:15:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372370376] [2024-11-23 01:15:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:15:47,344 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-11-23 01:15:47,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:15:47,345 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-11-23 01:15:47,347 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-11-23 01:15:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:15:47,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 01:15:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:15:47,533 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-23 01:15:47,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 01:15:47,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-23 01:15:47,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-23 01:15:47,548 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-11-23 01:15:47,741 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-11-23 01:15:47,747 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-23 01:15:47,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 01:15:47,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:15:47 BoogieIcfgContainer [2024-11-23 01:15:47,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 01:15:47,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 01:15:47,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 01:15:47,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 01:15:47,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:46" (3/4) ... [2024-11-23 01:15:47,789 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 01:15:47,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 01:15:47,794 INFO L158 Benchmark]: Toolchain (without parser) took 3124.88ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.4MB in the beginning and 53.1MB in the end (delta: -3.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,795 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 01:15:47,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1392.00ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.4MB in the beginning and 51.4MB in the end (delta: -2.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.50ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 48.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,802 INFO L158 Benchmark]: Boogie Preprocessor took 57.71ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 45.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,802 INFO L158 Benchmark]: RCFGBuilder took 552.85ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 55.1MB in the end (delta: -9.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,803 INFO L158 Benchmark]: TraceAbstraction took 1047.93ms. Allocated memory is still 88.1MB. Free memory was 54.5MB in the beginning and 53.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-11-23 01:15:47,804 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 53.1MB in the end (delta: 334.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 01:15:47,807 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.80ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1392.00ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.4MB in the beginning and 51.4MB in the end (delta: -2.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.50ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 48.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.71ms. Allocated memory is still 88.1MB. Free memory was 48.4MB in the beginning and 45.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.85ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 55.1MB in the end (delta: -9.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1047.93ms. Allocated memory is still 88.1MB. Free memory was 54.5MB in the beginning and 53.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 53.1MB in the end (delta: 334.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE191_Integer_Underflow__int_rand_sub_11_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE globalReturnsTrue() [L1559] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 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-11-23 01:15:47,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample