./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:20:59,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:20:59,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 13:20:59,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:20:59,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:20:59,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:20:59,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:20:59,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:20:59,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:20:59,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:20:59,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:20:59,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:20:59,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:20:59,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:20:59,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:20:59,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:20:59,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:20:59,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:20:59,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:20:59,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:20:59,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:20:59,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:20:59,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:20:59,542 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:20:59,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:20:59,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:20:59,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:20:59,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:20:59,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:20:59,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:20:59,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:20:59,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:20:59,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:20:59,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:20:59,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:20:59,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:20:59,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:20:59,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:20:59,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:20:59,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:20:59,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:20:59,550 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 -> 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 [2024-11-19 13:20:59,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:20:59,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:20:59,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:20:59,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:20:59,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:20:59,912 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_postdec_12_bad.i [2024-11-19 13:21:01,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:21:01,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:21:01,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-19 13:21:01,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9db90d5/f3ac38736d6340b4820614d4f9f4a581/FLAG1ce02ee59 [2024-11-19 13:21:01,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9db90d5/f3ac38736d6340b4820614d4f9f4a581 [2024-11-19 13:21:01,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:21:01,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:21:01,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:01,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:21:01,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:21:01,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:01" (1/1) ... [2024-11-19 13:21:01,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710e31f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:01, skipping insertion in model container [2024-11-19 13:21:01,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:01" (1/1) ... [2024-11-19 13:21:01,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:21:02,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:02,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:21:02,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:02,959 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:21:02,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02 WrapperNode [2024-11-19 13:21:02,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:02,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:02,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:21:02,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:21:02,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:02,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,020 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-11-19 13:21:03,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:03,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:21:03,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:21:03,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:21:03,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,051 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 13:21:03,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:21:03,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:21:03,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:21:03,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:21:03,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (1/1) ... [2024-11-19 13:21:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:03,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:21:03,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 13:21:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 13:21:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 13:21:03,162 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 13:21:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 13:21:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 13:21:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 13:21:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 13:21:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:21:03,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:21:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:21:03,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:21:03,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:21:03,572 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-19 13:21:03,572 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:21:03,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:21:03,587 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 13:21:03,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:03 BoogieIcfgContainer [2024-11-19 13:21:03,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:21:03,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:21:03,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:21:03,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:21:03,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:01" (1/3) ... [2024-11-19 13:21:03,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f4d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:03, skipping insertion in model container [2024-11-19 13:21:03,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:02" (2/3) ... [2024-11-19 13:21:03,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483f4d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:03, skipping insertion in model container [2024-11-19 13:21:03,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:03" (3/3) ... [2024-11-19 13:21:03,593 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-19 13:21:03,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:21:03,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 13:21:03,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:21:03,671 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;@2fb119d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:21:03,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 13:21:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 13:21:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 13:21:03,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:03,687 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-19 13:21:03,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 410761618, now seen corresponding path program 1 times [2024-11-19 13:21:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999757828] [2024-11-19 13:21:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:03,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:04,089 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-19 13:21:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999757828] [2024-11-19 13:21:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999757828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305988587] [2024-11-19 13:21:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,129 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-19 13:21:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:04,204 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2024-11-19 13:21:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:04,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 13:21:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:04,217 INFO L225 Difference]: With dead ends: 82 [2024-11-19 13:21:04,217 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 13:21:04,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,227 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:04,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 13:21:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-19 13:21:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 45 states have internal predecessors, (61), 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-19 13:21:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-11-19 13:21:04,272 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 21 [2024-11-19 13:21:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:04,274 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-11-19 13:21:04,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 13:21:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2024-11-19 13:21:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 13:21:04,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:04,276 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-19 13:21:04,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:21:04,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:04,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -151283612, now seen corresponding path program 1 times [2024-11-19 13:21:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503411102] [2024-11-19 13:21:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:04,375 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-19 13:21:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503411102] [2024-11-19 13:21:04,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503411102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:04,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:04,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057725790] [2024-11-19 13:21:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:04,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,394 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:04,434 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-11-19 13:21:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:04,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:04,438 INFO L225 Difference]: With dead ends: 56 [2024-11-19 13:21:04,438 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 13:21:04,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,441 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:04,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 13:21:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-19 13:21:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 47 states have internal predecessors, (63), 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-19 13:21:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-11-19 13:21:04,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 22 [2024-11-19 13:21:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:04,457 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-11-19 13:21:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-11-19 13:21:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 13:21:04,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:04,459 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-19 13:21:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 13:21:04,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -151291588, now seen corresponding path program 1 times [2024-11-19 13:21:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795255802] [2024-11-19 13:21:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:04,554 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-19 13:21:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795255802] [2024-11-19 13:21:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795255802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:04,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:04,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:04,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095483066] [2024-11-19 13:21:04,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:04,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,558 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:04,576 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-19 13:21:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:04,577 INFO L225 Difference]: With dead ends: 56 [2024-11-19 13:21:04,577 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 13:21:04,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,579 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:04,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 13:21:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 13:21:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 46 states have internal predecessors, (61), 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-19 13:21:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2024-11-19 13:21:04,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 22 [2024-11-19 13:21:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:04,585 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2024-11-19 13:21:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 13:21:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-19 13:21:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 13:21:04,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:04,587 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] [2024-11-19 13:21:04,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:21:04,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:04,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash -394824523, now seen corresponding path program 1 times [2024-11-19 13:21:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:04,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922049125] [2024-11-19 13:21:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:04,643 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-19 13:21:04,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:04,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922049125] [2024-11-19 13:21:04,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922049125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:04,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:04,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923239377] [2024-11-19 13:21:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:04,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,645 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-19 13:21:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:04,660 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-11-19 13:21:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2024-11-19 13:21:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:04,662 INFO L225 Difference]: With dead ends: 55 [2024-11-19 13:21:04,662 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 13:21:04,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:04,663 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:04,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 13:21:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 13:21:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 42 states have internal predecessors, (56), 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-19 13:21:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-19 13:21:04,668 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 23 [2024-11-19 13:21:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:04,668 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-19 13:21:04,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-19 13:21:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-19 13:21:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 13:21:04,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:04,670 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-19 13:21:04,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 13:21:04,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:04,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash 859877077, now seen corresponding path program 1 times [2024-11-19 13:21:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712837714] [2024-11-19 13:21:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:04,930 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-19 13:21:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712837714] [2024-11-19 13:21:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712837714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:04,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:21:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587365034] [2024-11-19 13:21:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:21:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:04,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:21:04,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:21:04,936 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-19 13:21:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:05,022 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-19 13:21:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 13:21:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-19 13:21:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:05,024 INFO L225 Difference]: With dead ends: 57 [2024-11-19 13:21:05,024 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 13:21:05,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:21:05,026 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:05,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 326 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:21:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 13:21:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-19 13:21:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 47 states have internal predecessors, (62), 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-19 13:21:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-11-19 13:21:05,034 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 27 [2024-11-19 13:21:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:05,034 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-11-19 13:21:05,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-19 13:21:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-11-19 13:21:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 13:21:05,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:05,037 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-19 13:21:05,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 13:21:05,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:05,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 504627067, now seen corresponding path program 1 times [2024-11-19 13:21:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:05,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138934333] [2024-11-19 13:21:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:05,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:05,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:21:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:05,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 13:21:05,123 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:21:05,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 13:21:05,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 13:21:05,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 13:21:05,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 13:21:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:21:05,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 13:21:05,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:21:05,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:21:05 BoogieIcfgContainer [2024-11-19 13:21:05,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:21:05,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:21:05,160 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:21:05,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:21:05,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:03" (3/4) ... [2024-11-19 13:21:05,164 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:21:05,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:21:05,166 INFO L158 Benchmark]: Toolchain (without parser) took 3343.02ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 88.6MB in the beginning and 83.1MB in the end (delta: 5.5MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,166 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:05,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1134.47ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 87.7MB in the end (delta: 458.5kB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.23ms. Allocated memory is still 136.3MB. Free memory was 87.7MB in the beginning and 84.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,167 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,168 INFO L158 Benchmark]: RCFGBuilder took 523.17ms. Allocated memory is still 136.3MB. Free memory was 82.5MB in the beginning and 90.0MB in the end (delta: -7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,168 INFO L158 Benchmark]: TraceAbstraction took 1571.19ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 89.5MB in the beginning and 83.1MB in the end (delta: 6.4MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-11-19 13:21:05,168 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 192.9MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:05,170 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.22ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1134.47ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 87.7MB in the end (delta: 458.5kB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.23ms. Allocated memory is still 136.3MB. Free memory was 87.7MB in the beginning and 84.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 136.3MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.17ms. Allocated memory is still 136.3MB. Free memory was 82.5MB in the beginning and 90.0MB in the end (delta: -7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1571.19ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 89.5MB in the beginning and 83.1MB in the end (delta: 6.4MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 192.9MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE191_Integer_Underflow__int_rand_postdec_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 785 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 341 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 15/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-19 13:21:05,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:21:07,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:21:07,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 13:21:07,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:21:07,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:21:07,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 13:21:07,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:21:07,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:21:07,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:21:07,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:21:07,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:21:07,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:21:07,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:21:07,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:21:07,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:21:07,648 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:21:07,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:21:07,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:21:07,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:21:07,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:21:07,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:21:07,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:21:07,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 13:21:07,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 13:21:07,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:21:07,655 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:21:07,655 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 13:21:07,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:21:07,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:21:07,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:21:07,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:21:07,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:21:07,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:21:07,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:21:07,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:07,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:21:07,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:21:07,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:21:07,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 13:21:07,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 13:21:07,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:21:07,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:21:07,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:21:07,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:21:07,661 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 -> 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 [2024-11-19 13:21:08,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:21:08,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:21:08,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:21:08,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:21:08,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:21:08,044 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_postdec_12_bad.i [2024-11-19 13:21:09,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:21:10,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:21:10,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-19 13:21:10,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c42edff/36ec0c6a9ef44def95c51ba3d721bef7/FLAGe34b5ee7f [2024-11-19 13:21:10,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c42edff/36ec0c6a9ef44def95c51ba3d721bef7 [2024-11-19 13:21:10,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:21:10,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:21:10,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:10,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:21:10,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:21:10,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:10" (1/1) ... [2024-11-19 13:21:10,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea3f2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:10, skipping insertion in model container [2024-11-19 13:21:10,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:10" (1/1) ... [2024-11-19 13:21:10,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:21:11,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:11,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:21:11,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:11,472 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:21:11,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11 WrapperNode [2024-11-19 13:21:11,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:11,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:11,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:21:11,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:21:11,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,561 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-19 13:21:11,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:11,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:21:11,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:21:11,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:21:11,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,590 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 13:21:11,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:21:11,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:21:11,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:21:11,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:21:11,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (1/1) ... [2024-11-19 13:21:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:21:11,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 13:21:11,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 13:21:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 13:21:11,692 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 13:21:11,692 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 13:21:11,692 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 13:21:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 13:21:11,693 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 13:21:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:21:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:21:11,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:21:11,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:21:11,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:21:12,029 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 13:21:12,030 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:21:12,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:21:12,043 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 13:21:12,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:12 BoogieIcfgContainer [2024-11-19 13:21:12,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:21:12,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:21:12,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:21:12,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:21:12,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:10" (1/3) ... [2024-11-19 13:21:12,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:12, skipping insertion in model container [2024-11-19 13:21:12,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:11" (2/3) ... [2024-11-19 13:21:12,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:12, skipping insertion in model container [2024-11-19 13:21:12,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:12" (3/3) ... [2024-11-19 13:21:12,052 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-19 13:21:12,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:21:12,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 13:21:12,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:21:12,129 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;@405764b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:21:12,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 13:21:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 13:21:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 13:21:12,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:12,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:12,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1536608006, now seen corresponding path program 1 times [2024-11-19 13:21:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102876937] [2024-11-19 13:21:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:12,164 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-19 13:21:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:12,175 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-19 13:21:12,176 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-19 13:21:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:12,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:21:12,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:21:12,386 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-19 13:21:12,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:21:12,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:21:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102876937] [2024-11-19 13:21:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102876937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595564921] [2024-11-19 13:21:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:21:12,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:12,418 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 13:21:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:12,473 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-11-19 13:21:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-19 13:21:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:12,484 INFO L225 Difference]: With dead ends: 59 [2024-11-19 13:21:12,484 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 13:21:12,488 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-19 13:21:12,493 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:12,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 13:21:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-19 13:21:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 13:21:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-19 13:21:12,526 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2024-11-19 13:21:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 13:21:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 13:21:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-19 13:21:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 13:21:12,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:12,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:12,536 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-19 13:21:12,731 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-19 13:21:12,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 390215974, now seen corresponding path program 1 times [2024-11-19 13:21:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579743694] [2024-11-19 13:21:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:12,734 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-19 13:21:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:12,736 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-19 13:21:12,738 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-19 13:21:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:12,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:21:12,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:21:12,897 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-19 13:21:12,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:21:12,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:21:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579743694] [2024-11-19 13:21:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579743694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:12,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:12,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943050805] [2024-11-19 13:21:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:21:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:12,904 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 13:21:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:12,924 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-19 13:21:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-19 13:21:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:12,926 INFO L225 Difference]: With dead ends: 27 [2024-11-19 13:21:12,927 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 13:21:12,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-19 13:21:12,928 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:12,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 13:21:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 13:21:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 13:21:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-19 13:21:12,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2024-11-19 13:21:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:12,934 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-19 13:21:12,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 13:21:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-19 13:21:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 13:21:12,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:12,935 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-19 13:21:12,942 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-19 13:21:13,135 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-19 13:21:13,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 13:21:13,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 211589793, now seen corresponding path program 1 times [2024-11-19 13:21:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480802416] [2024-11-19 13:21:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:13,138 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-19 13:21:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:13,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:21:13,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 13:21:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:13,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:21:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:13,312 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 13:21:13,313 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:21:13,314 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 13:21:13,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 13:21:13,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 13:21:13,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 13:21:13,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 13:21:13,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:21:13,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 13:21:13,554 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:21:13,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:21:13 BoogieIcfgContainer [2024-11-19 13:21:13,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:21:13,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:21:13,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:21:13,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:21:13,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:12" (3/4) ... [2024-11-19 13:21:13,563 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:21:13,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:21:13,565 INFO L158 Benchmark]: Toolchain (without parser) took 3463.64ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 33.4MB in the beginning and 89.6MB in the end (delta: -56.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-19 13:21:13,565 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 73.4MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:13,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1385.78ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 33.2MB in the beginning and 111.3MB in the end (delta: -78.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:13,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.75ms. Allocated memory is still 138.4MB. Free memory was 111.3MB in the beginning and 108.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:13,566 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 138.4MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:13,568 INFO L158 Benchmark]: RCFGBuilder took 429.88ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 89.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 13:21:13,568 INFO L158 Benchmark]: TraceAbstraction took 1513.07ms. Allocated memory is still 138.4MB. Free memory was 88.2MB in the beginning and 89.6MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:13,568 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 138.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:13,570 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.99ms. Allocated memory is still 73.4MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1385.78ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 33.2MB in the beginning and 111.3MB in the end (delta: -78.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.75ms. Allocated memory is still 138.4MB. Free memory was 111.3MB in the beginning and 108.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 138.4MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.88ms. Allocated memory is still 138.4MB. Free memory was 105.8MB in the beginning and 89.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1513.07ms. Allocated memory is still 138.4MB. Free memory was 88.2MB in the beginning and 89.6MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 138.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE191_Integer_Underflow__int_rand_postdec_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 76 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-19 13:21:13,602 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