./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/CWE190_Integer_Overflow__int_rand_add_08_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 ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:38:46,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:38:46,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:38:46,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:38:46,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:38:47,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:38:47,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:38:47,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:38:47,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:38:47,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:38:47,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:38:47,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:38:47,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:38:47,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:38:47,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:38:47,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:38:47,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:38:47,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:38:47,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:38:47,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:38:47,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:38:47,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:38:47,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:38:47,040 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:38:47,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:38:47,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:38:47,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:38:47,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:38:47,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:38:47,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:38:47,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:38:47,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:38:47,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:38:47,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:38:47,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:38:47,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:38:47,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:38:47,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:38:47,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:38:47,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:38:47,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:38:47,048 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 -> ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c [2024-11-09 13:38:47,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:38:47,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:38:47,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:38:47,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:38:47,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:38:47,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:48,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:38:49,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:38:49,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:49,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184e1c6d4/64b2015b482944f1a083e8530546c6d7/FLAGf46a1116d [2024-11-09 13:38:49,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184e1c6d4/64b2015b482944f1a083e8530546c6d7 [2024-11-09 13:38:49,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:38:49,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:38:49,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:38:49,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:38:49,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:38:49,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:49" (1/1) ... [2024-11-09 13:38:49,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2016c7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:49, skipping insertion in model container [2024-11-09 13:38:49,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:49" (1/1) ... [2024-11-09 13:38:49,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:38:50,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:38:50,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:38:50,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:38:50,493 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:38:50,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50 WrapperNode [2024-11-09 13:38:50,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:38:50,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:38:50,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:38:50,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:38:50,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,547 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-09 13:38:50,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:38:50,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:38:50,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:38:50,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:38:50,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,570 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:38:50,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:38:50,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:38:50,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:38:50,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:38:50,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (1/1) ... [2024-11-09 13:38:50,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:38:50,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:38:50,630 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-09 13:38:50,636 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-09 13:38:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:38:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:38:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:38:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:38:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:38:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-09 13:38:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-09 13:38:50,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:38:50,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:38:50,990 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 13:38:50,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:38:51,003 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:38:51,003 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:38:51,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:51 BoogieIcfgContainer [2024-11-09 13:38:51,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:38:51,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:38:51,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:38:51,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:38:51,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:38:49" (1/3) ... [2024-11-09 13:38:51,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:51, skipping insertion in model container [2024-11-09 13:38:51,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:50" (2/3) ... [2024-11-09 13:38:51,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:51, skipping insertion in model container [2024-11-09 13:38:51,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:51" (3/3) ... [2024-11-09 13:38:51,010 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:51,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:38:51,026 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:38:51,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:38:51,095 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;@e8e62cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:38:51,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:38:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 13:38:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 13:38:51,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:51,107 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-09 13:38:51,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:51,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1648115636, now seen corresponding path program 1 times [2024-11-09 13:38:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:38:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638902919] [2024-11-09 13:38:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:38:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:38:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 13:38:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 13:38:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 13:38:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:38:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638902919] [2024-11-09 13:38:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638902919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 13:38:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680878142] [2024-11-09 13:38:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:51,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 13:38:51,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:38:51,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 13:38:51,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 13:38:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:51,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:38:51,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:38:51,639 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-09 13:38:51,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:38:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680878142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:38:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 13:38:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 13:38:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561303623] [2024-11-09 13:38:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:38:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:38:51,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:38:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:38:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 13:38:51,673 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:38:51,705 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-09 13:38:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:38:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-09 13:38:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:38:51,713 INFO L225 Difference]: With dead ends: 57 [2024-11-09 13:38:51,713 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 13:38:51,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 13:38:51,718 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:38:51,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:38:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 13:38:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-09 13:38:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 13:38:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-09 13:38:51,769 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-09 13:38:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:38:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-09 13:38:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-09 13:38:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 13:38:51,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:51,772 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-09 13:38:51,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 13:38:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 13:38:51,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -448022698, now seen corresponding path program 1 times [2024-11-09 13:38:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:38:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136546548] [2024-11-09 13:38:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:38:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:38:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 13:38:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 13:38:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 13:38:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:38:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136546548] [2024-11-09 13:38:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136546548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 13:38:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078428957] [2024-11-09 13:38:52,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 13:38:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:38:52,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 13:38:52,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 13:38:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:38:52,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:38:52,134 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-09 13:38:52,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:38:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078428957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:38:52,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 13:38:52,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 13:38:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246382169] [2024-11-09 13:38:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:38:52,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:38:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:38:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:38:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 13:38:52,138 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:38:52,151 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-09 13:38:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:38:52,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 13:38:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:38:52,152 INFO L225 Difference]: With dead ends: 49 [2024-11-09 13:38:52,153 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 13:38:52,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 13:38:52,154 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:38:52,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:38:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 13:38:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 13:38:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 13:38:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-09 13:38:52,159 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-09 13:38:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:38:52,160 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-09 13:38:52,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-09 13:38:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 13:38:52,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:52,161 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-09 13:38:52,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 13:38:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 13:38:52,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 10447351, now seen corresponding path program 1 times [2024-11-09 13:38:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:38:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292218652] [2024-11-09 13:38:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:38:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:38:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 13:38:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 13:38:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:52,445 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-09 13:38:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:38:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292218652] [2024-11-09 13:38:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292218652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:38:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:38:52,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:38:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27697011] [2024-11-09 13:38:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:38:52,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:38:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:38:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:38:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:38:52,448 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-09 13:38:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:38:52,457 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-09 13:38:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:38:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-09 13:38:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:38:52,458 INFO L225 Difference]: With dead ends: 43 [2024-11-09 13:38:52,458 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 13:38:52,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:38:52,459 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:38:52,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:38:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 13:38:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 13:38:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-09 13:38:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-09 13:38:52,464 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 27 [2024-11-09 13:38:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:38:52,464 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-09 13:38:52,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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-09 13:38:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-09 13:38:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 13:38:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:52,466 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, 1] [2024-11-09 13:38:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:38:52,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 323868019, now seen corresponding path program 1 times [2024-11-09 13:38:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:38:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797145030] [2024-11-09 13:38:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:38:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:38:52,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:38:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:38:52,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:38:52,505 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:38:52,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:38:52,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:38:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 13:38:52,510 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 13:38:52,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:38:52,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:38:52 BoogieIcfgContainer [2024-11-09 13:38:52,535 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:38:52,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:38:52,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:38:52,536 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:38:52,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:51" (3/4) ... [2024-11-09 13:38:52,538 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:38:52,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:38:52,540 INFO L158 Benchmark]: Toolchain (without parser) took 3003.97ms. Allocated memory is still 207.6MB. Free memory was 134.1MB in the beginning and 119.3MB in the end (delta: 14.8MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,540 INFO L158 Benchmark]: CDTParser took 3.96ms. Allocated memory is still 104.9MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:38:52,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 956.87ms. Allocated memory is still 207.6MB. Free memory was 133.8MB in the beginning and 143.9MB in the end (delta: -10.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.03ms. Allocated memory is still 207.6MB. Free memory was 143.9MB in the beginning and 141.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,541 INFO L158 Benchmark]: Boogie Preprocessor took 39.96ms. Allocated memory is still 207.6MB. Free memory was 141.2MB in the beginning and 138.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,541 INFO L158 Benchmark]: RCFGBuilder took 415.39ms. Allocated memory is still 207.6MB. Free memory was 138.2MB in the beginning and 120.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,542 INFO L158 Benchmark]: TraceAbstraction took 1530.56ms. Allocated memory is still 207.6MB. Free memory was 119.5MB in the beginning and 120.4MB in the end (delta: -891.3kB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-11-09 13:38:52,542 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 207.6MB. Free memory was 120.4MB in the beginning and 119.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:38:52,543 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.96ms. Allocated memory is still 104.9MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 956.87ms. Allocated memory is still 207.6MB. Free memory was 133.8MB in the beginning and 143.9MB in the end (delta: -10.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.03ms. Allocated memory is still 207.6MB. Free memory was 143.9MB in the beginning and 141.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.96ms. Allocated memory is still 207.6MB. Free memory was 141.2MB in the beginning and 138.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 415.39ms. Allocated memory is still 207.6MB. Free memory was 138.2MB in the beginning and 120.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1530.56ms. Allocated memory is still 207.6MB. Free memory was 119.5MB in the beginning and 120.4MB in the end (delta: -891.3kB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 207.6MB. Free memory was 120.4MB in the beginning and 119.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1567]: 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 1575. 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] [L1575] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1575] 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] [L1576] CALL CWE190_Integer_Overflow__int_rand_add_08_bad() [L1558] int data; [L1559] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1567] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 179 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 13:38:52,567 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/CWE190_Integer_Overflow__int_rand_add_08_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 ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:38:54,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:38:54,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:38:54,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:38:54,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:38:54,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:38:54,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:38:54,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:38:54,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:38:54,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:38:54,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:38:54,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:38:54,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:38:54,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:38:54,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:38:54,648 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:38:54,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:38:54,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:38:54,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:38:54,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:38:54,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:38:54,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:38:54,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:38:54,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:38:54,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:38:54,650 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:38:54,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:38:54,651 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:38:54,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:38:54,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:38:54,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:38:54,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:38:54,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:38:54,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:38:54,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:38:54,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:38:54,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:38:54,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:38:54,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:38:54,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:38:54,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:38:54,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:38:54,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:38:54,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:38:54,654 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 -> ac0087c766cc1b03cb6dbeb149b27730aa5d0c1239e40b9fedc40179a0fb039c [2024-11-09 13:38:54,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:38:54,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:38:54,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:38:54,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:38:54,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:38:54,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:56,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:38:56,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:38:56,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:56,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b01fc678/f4cc4a02729f47c7970fc112e16305e4/FLAGd07cf903e [2024-11-09 13:38:56,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b01fc678/f4cc4a02729f47c7970fc112e16305e4 [2024-11-09 13:38:56,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:38:56,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:38:56,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:38:56,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:38:56,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:38:56,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:56" (1/1) ... [2024-11-09 13:38:56,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b68921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:56, skipping insertion in model container [2024-11-09 13:38:56,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:56" (1/1) ... [2024-11-09 13:38:56,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:38:57,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:38:57,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:38:57,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:38:57,791 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:38:57,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57 WrapperNode [2024-11-09 13:38:57,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:38:57,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:38:57,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:38:57,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:38:57,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,870 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-09 13:38:57,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:38:57,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:38:57,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:38:57,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:38:57,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,894 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:38:57,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:38:57,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:38:57,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:38:57,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:38:57,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (1/1) ... [2024-11-09 13:38:57,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:38:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:38:57,947 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-09 13:38:57,956 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-09 13:38:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:38:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:38:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:38:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:38:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:38:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-09 13:38:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-09 13:38:58,139 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:38:58,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:38:58,270 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 13:38:58,271 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:38:58,282 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:38:58,282 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:38:58,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:58 BoogieIcfgContainer [2024-11-09 13:38:58,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:38:58,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:38:58,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:38:58,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:38:58,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:38:56" (1/3) ... [2024-11-09 13:38:58,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:58, skipping insertion in model container [2024-11-09 13:38:58,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:57" (2/3) ... [2024-11-09 13:38:58,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:58, skipping insertion in model container [2024-11-09 13:38:58,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:58" (3/3) ... [2024-11-09 13:38:58,293 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_08_bad.i [2024-11-09 13:38:58,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:38:58,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:38:58,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:38:58,382 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;@220dc42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:38:58,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:38:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 13:38:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 13:38:58,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:58,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:38:58,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:58,399 INFO L85 PathProgramCache]: Analyzing trace with hash -894708504, now seen corresponding path program 1 times [2024-11-09 13:38:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:38:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109496066] [2024-11-09 13:38:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:58,411 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-09 13:38:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:38:58,415 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-09 13:38:58,428 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-09 13:38:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:58,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 13:38:58,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:38:58,549 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-09 13:38:58,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:38:58,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:38:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109496066] [2024-11-09 13:38:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109496066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:38:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:38:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 13:38:58,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888872470] [2024-11-09 13:38:58,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:38:58,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 13:38:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:38:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 13:38:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:38:58,575 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 13:38:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:38:58,589 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-09 13:38:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 13:38:58,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-09 13:38:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:38:58,596 INFO L225 Difference]: With dead ends: 28 [2024-11-09 13:38:58,596 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 13:38:58,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:38:58,604 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:38:58,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:38:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 13:38:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 13:38:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-09 13:38:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 13:38:58,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 19 [2024-11-09 13:38:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:38:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 13:38:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 13:38:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-09 13:38:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 13:38:58,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:58,636 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-09 13:38:58,643 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-09 13:38:58,837 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-09 13:38:58,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1966159784, now seen corresponding path program 1 times [2024-11-09 13:38:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:38:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669407695] [2024-11-09 13:38:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:58,842 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-09 13:38:58,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:38:58,845 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-09 13:38:58,848 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-09 13:38:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:38:58,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 13:38:58,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:38:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 13:38:58,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:38:58,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:38:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669407695] [2024-11-09 13:38:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669407695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:38:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:38:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 13:38:58,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286588466] [2024-11-09 13:38:58,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:38:58,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 13:38:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:38:58,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 13:38:58,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 13:38:58,973 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:38:58,981 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-09 13:38:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 13:38:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-09 13:38:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:38:58,983 INFO L225 Difference]: With dead ends: 28 [2024-11-09 13:38:58,983 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 13:38:58,983 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-09 13:38:58,984 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:38:58,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:38:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 13:38:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 13:38:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-09 13:38:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 13:38:58,988 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 20 [2024-11-09 13:38:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:38:58,988 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 13:38:58,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 13:38:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-09 13:38:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 13:38:58,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:38:58,989 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-09 13:38:58,994 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 13:38:59,192 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-09 13:38:59,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:38:59,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:38:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 119673117, now seen corresponding path program 1 times [2024-11-09 13:38:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:38:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718362626] [2024-11-09 13:38:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:38:59,198 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-09 13:38:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:38:59,203 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-09 13:38:59,209 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-09 13:38:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:38:59,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:38:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:38:59,299 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:38:59,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:38:59,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:38:59,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:38:59,308 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-09 13:38:59,505 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-09 13:38:59,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:38:59,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:38:59,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:38:59 BoogieIcfgContainer [2024-11-09 13:38:59,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:38:59,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:38:59,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:38:59,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:38:59,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:58" (3/4) ... [2024-11-09 13:38:59,545 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:38:59,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:38:59,548 INFO L158 Benchmark]: Toolchain (without parser) took 2660.71ms. Allocated memory was 79.7MB in the beginning and 119.5MB in the end (delta: 39.8MB). Free memory was 39.3MB in the beginning and 74.6MB in the end (delta: -35.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-09 13:38:59,550 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 44.0MB. Free memory was 20.9MB in the beginning and 20.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:38:59,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 904.42ms. Allocated memory was 79.7MB in the beginning and 119.5MB in the end (delta: 39.8MB). Free memory was 39.0MB in the beginning and 57.3MB in the end (delta: -18.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-09 13:38:59,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.15ms. Allocated memory is still 119.5MB. Free memory was 57.3MB in the beginning and 91.8MB in the end (delta: -34.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 13:38:59,556 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 119.5MB. Free memory was 91.8MB in the beginning and 89.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:38:59,557 INFO L158 Benchmark]: RCFGBuilder took 377.47ms. Allocated memory is still 119.5MB. Free memory was 89.0MB in the beginning and 75.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:38:59,557 INFO L158 Benchmark]: TraceAbstraction took 1254.80ms. Allocated memory is still 119.5MB. Free memory was 74.3MB in the beginning and 74.6MB in the end (delta: -231.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:38:59,557 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 119.5MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:38:59,558 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.91ms. Allocated memory is still 44.0MB. Free memory was 20.9MB in the beginning and 20.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 904.42ms. Allocated memory was 79.7MB in the beginning and 119.5MB in the end (delta: 39.8MB). Free memory was 39.0MB in the beginning and 57.3MB in the end (delta: -18.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.15ms. Allocated memory is still 119.5MB. Free memory was 57.3MB in the beginning and 91.8MB in the end (delta: -34.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 119.5MB. Free memory was 91.8MB in the beginning and 89.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.47ms. Allocated memory is still 119.5MB. Free memory was 89.0MB in the beginning and 75.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1254.80ms. Allocated memory is still 119.5MB. Free memory was 74.3MB in the beginning and 74.6MB in the end (delta: -231.7kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 119.5MB. Free memory is still 74.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: 1567]: 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 1575. 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] [L1575] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1575] 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] [L1576] CALL CWE190_Integer_Overflow__int_rand_add_08_bad() [L1558] int data; [L1559] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1567] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 4 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-09 13:38:59,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample