./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_13_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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_13_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 fb95544c3909148ef26323d172aa9a23c748437c4cd355f5b0cbad2a7b34bd22 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:20:22,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:20:22,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 06:20:22,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:20:22,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:20:22,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:20:22,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:20:22,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:20:22,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:20:22,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:20:22,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:20:22,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:20:22,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:20:22,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:20:22,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:20:22,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:20:22,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:20:22,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 06:20:22,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:20:22,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:20:22,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:20:22,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:20:22,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:20:22,246 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:20:22,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:20:22,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:20:22,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:20:22,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:20:22,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:20:22,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:20:22,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:20:22,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:22,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:20:22,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:20:22,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:20:22,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 06:20:22,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 06:20:22,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:20:22,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:20:22,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:20:22,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:20:22,252 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 -> fb95544c3909148ef26323d172aa9a23c748437c4cd355f5b0cbad2a7b34bd22 [2024-11-17 06:20:22,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:20:22,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:20:22,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:20:22,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:20:22,561 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:20:22,562 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_13_bad.i [2024-11-17 06:20:24,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:20:24,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:20:24,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_13_bad.i [2024-11-17 06:20:24,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b7f0cc7/fdcc18ccb70640f697a674f845f05dd3/FLAG8decfdaa0 [2024-11-17 06:20:24,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40b7f0cc7/fdcc18ccb70640f697a674f845f05dd3 [2024-11-17 06:20:24,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:20:24,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:20:24,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:24,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:20:24,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:20:24,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:24" (1/1) ... [2024-11-17 06:20:24,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479a79f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:24, skipping insertion in model container [2024-11-17 06:20:24,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:24" (1/1) ... [2024-11-17 06:20:24,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:20:25,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:25,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:20:25,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:25,661 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:20:25,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25 WrapperNode [2024-11-17 06:20:25,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:25,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:25,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:20:25,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:20:25,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,722 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2024-11-17 06:20:25,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:25,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:20:25,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:20:25,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:20:25,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,750 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:20:25,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:20:25,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:20:25,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:20:25,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:20:25,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (1/1) ... [2024-11-17 06:20:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:20:25,818 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-17 06:20:25,824 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-17 06:20:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:20:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:20:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:20:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:20:25,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:20:26,019 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:20:26,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:20:26,281 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-17 06:20:26,282 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:20:26,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:20:26,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:20:26,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:26 BoogieIcfgContainer [2024-11-17 06:20:26,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:20:26,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:20:26,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:20:26,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:20:26,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:20:24" (1/3) ... [2024-11-17 06:20:26,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd3855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:26, skipping insertion in model container [2024-11-17 06:20:26,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:25" (2/3) ... [2024-11-17 06:20:26,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd3855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:26, skipping insertion in model container [2024-11-17 06:20:26,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:26" (3/3) ... [2024-11-17 06:20:26,326 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_13_bad.i [2024-11-17 06:20:26,346 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:20:26,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 06:20:26,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:20:26,420 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;@54f587e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:20:26,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 06:20:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 06:20:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:20:26,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:26,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:26,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:26,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1097144348, now seen corresponding path program 1 times [2024-11-17 06:20:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683919591] [2024-11-17 06:20:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:20:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683919591] [2024-11-17 06:20:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683919591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:26,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:20:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644453854] [2024-11-17 06:20:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:20:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:20:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:20:26,755 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:26,795 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2024-11-17 06:20:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:20:26,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-17 06:20:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:26,808 INFO L225 Difference]: With dead ends: 61 [2024-11-17 06:20:26,808 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 06:20:26,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 06:20:26,813 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:20:26,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:20:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 06:20:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 06:20:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-17 06:20:26,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 11 [2024-11-17 06:20:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-17 06:20:26,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-17 06:20:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 06:20:26,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:26,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 06:20:26,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:26,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1163138986, now seen corresponding path program 1 times [2024-11-17 06:20:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:26,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940685601] [2024-11-17 06:20:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:27,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:20:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940685601] [2024-11-17 06:20:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940685601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 06:20:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890748696] [2024-11-17 06:20:27,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 06:20:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 06:20:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 06:20:27,145 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:27,269 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-17 06:20:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 06:20:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-17 06:20:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:27,270 INFO L225 Difference]: With dead ends: 42 [2024-11-17 06:20:27,270 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 06:20:27,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 06:20:27,272 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 06:20:27,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 147 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 06:20:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 06:20:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-17 06:20:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-17 06:20:27,286 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2024-11-17 06:20:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-17 06:20:27,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-17 06:20:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 06:20:27,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:27,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 06:20:27,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:27,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 161564535, now seen corresponding path program 1 times [2024-11-17 06:20:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121455901] [2024-11-17 06:20:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:20:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121455901] [2024-11-17 06:20:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121455901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:20:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898045037] [2024-11-17 06:20:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:20:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:20:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:20:27,397 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:27,418 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-17 06:20:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:20:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-17 06:20:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:27,433 INFO L225 Difference]: With dead ends: 40 [2024-11-17 06:20:27,435 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 06:20:27,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 06:20:27,436 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:20:27,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:20:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 06:20:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-17 06:20:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-17 06:20:27,449 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2024-11-17 06:20:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-17 06:20:27,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-17 06:20:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 06:20:27,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:27,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:27,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 06:20:27,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1697570179, now seen corresponding path program 1 times [2024-11-17 06:20:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231552586] [2024-11-17 06:20:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:27,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:20:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:27,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 06:20:27,524 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:20:27,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 06:20:27,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 06:20:27,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 06:20:27,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 06:20:27,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:20:27,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:20:27 BoogieIcfgContainer [2024-11-17 06:20:27,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:20:27,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:20:27,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:20:27,566 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:20:27,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:26" (3/4) ... [2024-11-17 06:20:27,569 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:20:27,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:20:27,570 INFO L158 Benchmark]: Toolchain (without parser) took 2972.70ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 119.6MB in the end (delta: 4.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,571 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 82.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:27,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1063.16ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 58.0MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.83ms. Allocated memory is still 161.5MB. Free memory was 58.0MB in the beginning and 54.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,572 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 161.5MB. Free memory was 54.6MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,572 INFO L158 Benchmark]: IcfgBuilder took 552.77ms. Allocated memory is still 161.5MB. Free memory was 52.6MB in the beginning and 121.3MB in the end (delta: -68.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,572 INFO L158 Benchmark]: TraceAbstraction took 1245.25ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 120.7MB in the end (delta: 436.8kB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-11-17 06:20:27,573 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 119.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:27,575 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.18ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 82.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1063.16ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 58.0MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.83ms. Allocated memory is still 161.5MB. Free memory was 58.0MB in the beginning and 54.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 161.5MB. Free memory was 54.6MB in the beginning and 52.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 552.77ms. Allocated memory is still 161.5MB. Free memory was 52.6MB in the beginning and 121.3MB in the end (delta: -68.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1245.25ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 120.7MB in the end (delta: 436.8kB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 119.6MB 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: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_13_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE GLOBAL_CONST_FIVE==5 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] [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 130 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-17 06:20:27,600 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_13_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 fb95544c3909148ef26323d172aa9a23c748437c4cd355f5b0cbad2a7b34bd22 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:20:29,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:20:29,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 06:20:29,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:20:29,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:20:29,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 06:20:30,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:20:30,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:20:30,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:20:30,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:20:30,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:20:30,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:20:30,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:20:30,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:20:30,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:20:30,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:20:30,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:20:30,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:20:30,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:20:30,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:20:30,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:20:30,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:20:30,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 06:20:30,038 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 06:20:30,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:20:30,039 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:20:30,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 06:20:30,039 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:20:30,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:20:30,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:20:30,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:20:30,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:20:30,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:20:30,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:20:30,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:30,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:20:30,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:20:30,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:20:30,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 06:20:30,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 06:20:30,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:20:30,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:20:30,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:20:30,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:20:30,046 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 -> fb95544c3909148ef26323d172aa9a23c748437c4cd355f5b0cbad2a7b34bd22 [2024-11-17 06:20:30,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:20:30,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:20:30,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:20:30,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:20:30,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:20:30,490 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_13_bad.i [2024-11-17 06:20:32,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:20:32,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:20:32,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_13_bad.i [2024-11-17 06:20:32,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ade40a0/bf536c1cabab4c2088377aa3b2cb2dda/FLAGf88c8453f [2024-11-17 06:20:32,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ade40a0/bf536c1cabab4c2088377aa3b2cb2dda [2024-11-17 06:20:32,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:20:32,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:20:32,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:32,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:20:32,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:20:32,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:32" (1/1) ... [2024-11-17 06:20:32,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33138526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:32, skipping insertion in model container [2024-11-17 06:20:32,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:32" (1/1) ... [2024-11-17 06:20:32,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:20:33,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:33,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:20:33,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:33,796 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:20:33,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33 WrapperNode [2024-11-17 06:20:33,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:33,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:33,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:20:33,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:20:33,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,864 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2024-11-17 06:20:33,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:33,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:20:33,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:20:33,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:20:33,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,891 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:20:33,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:20:33,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:20:33,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:20:33,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:20:33,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (1/1) ... [2024-11-17 06:20:33,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:20:33,952 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-17 06:20:33,954 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-17 06:20:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:20:33,998 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:20:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:20:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:20:33,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:20:34,159 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:20:34,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:20:34,320 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-17 06:20:34,321 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:20:34,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:20:34,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:20:34,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:34 BoogieIcfgContainer [2024-11-17 06:20:34,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:20:34,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:20:34,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:20:34,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:20:34,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:20:32" (1/3) ... [2024-11-17 06:20:34,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c776ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:34, skipping insertion in model container [2024-11-17 06:20:34,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:33" (2/3) ... [2024-11-17 06:20:34,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c776ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:34, skipping insertion in model container [2024-11-17 06:20:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:34" (3/3) ... [2024-11-17 06:20:34,353 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_13_bad.i [2024-11-17 06:20:34,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:20:34,371 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 06:20:34,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:20:34,448 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;@35db4eb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:20:34,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 06:20:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 06:20:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:20:34,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:34,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:34,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 456932820, now seen corresponding path program 1 times [2024-11-17 06:20:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806637245] [2024-11-17 06:20:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:34,483 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-17 06:20:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:34,487 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-17 06:20:34,488 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-17 06:20:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:34,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 06:20:34,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:20:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:20:34,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:20:34,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:20:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806637245] [2024-11-17 06:20:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806637245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 06:20:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638924292] [2024-11-17 06:20:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:34,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 06:20:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:20:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 06:20:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 06:20:34,682 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:34,696 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-17 06:20:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 06:20:34,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-17 06:20:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:34,705 INFO L225 Difference]: With dead ends: 24 [2024-11-17 06:20:34,705 INFO L226 Difference]: Without dead ends: 15 [2024-11-17 06:20:34,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-17 06:20:34,712 INFO L432 NwaCegarLoop]: 27 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, 27 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-17 06:20:34,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:20:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-17 06:20:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 06:20:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-17 06:20:34,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-17 06:20:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:34,739 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 06:20:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-17 06:20:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 06:20:34,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:34,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:34,746 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-17 06:20:34,941 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-17 06:20:34,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:34,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1280015513, now seen corresponding path program 1 times [2024-11-17 06:20:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:34,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51916878] [2024-11-17 06:20:34,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:34,944 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-17 06:20:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:34,946 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-17 06:20:34,947 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-17 06:20:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:35,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 06:20:35,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:20:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:20:35,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:20:35,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:20:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51916878] [2024-11-17 06:20:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51916878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:20:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916143065] [2024-11-17 06:20:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:20:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:20:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:20:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:20:35,044 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:35,052 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-17 06:20:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:20:35,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 06:20:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:35,053 INFO L225 Difference]: With dead ends: 19 [2024-11-17 06:20:35,053 INFO L226 Difference]: Without dead ends: 15 [2024-11-17 06:20:35,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-17 06:20:35,054 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:20:35,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:20:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-17 06:20:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 06:20:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-17 06:20:35,061 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-17 06:20:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:35,062 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-17 06:20:35,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:20:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-17 06:20:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 06:20:35,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:35,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:35,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 06:20:35,265 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-17 06:20:35,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:35,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1708525211, now seen corresponding path program 1 times [2024-11-17 06:20:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829691969] [2024-11-17 06:20:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:35,267 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-17 06:20:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:35,270 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-17 06:20:35,279 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-17 06:20:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:35,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:20:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:35,431 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 06:20:35,432 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:20:35,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 06:20:35,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 06:20:35,441 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-17 06:20:35,640 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-17 06:20:35,643 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 06:20:35,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:20:35,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:20:35 BoogieIcfgContainer [2024-11-17 06:20:35,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:20:35,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:20:35,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:20:35,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:20:35,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:34" (3/4) ... [2024-11-17 06:20:35,721 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:20:35,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:20:35,726 INFO L158 Benchmark]: Toolchain (without parser) took 3215.92ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 44.3MB in the beginning and 58.2MB in the end (delta: -13.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,727 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 46.1MB. Free memory was 26.9MB in the beginning and 26.8MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:35,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1291.13ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 44.3MB in the beginning and 49.1MB in the end (delta: -4.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.20ms. Allocated memory is still 88.1MB. Free memory was 49.1MB in the beginning and 46.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,730 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 88.1MB. Free memory was 46.1MB in the beginning and 43.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,730 INFO L158 Benchmark]: IcfgBuilder took 424.67ms. Allocated memory is still 88.1MB. Free memory was 43.6MB in the beginning and 53.3MB in the end (delta: -9.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,731 INFO L158 Benchmark]: TraceAbstraction took 1368.47ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 58.8MB in the end (delta: -6.2MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-11-17 06:20:35,733 INFO L158 Benchmark]: Witness Printer took 8.00ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 58.2MB in the end (delta: 619.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:35,735 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.25ms. Allocated memory is still 46.1MB. Free memory was 26.9MB in the beginning and 26.8MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1291.13ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 44.3MB in the beginning and 49.1MB in the end (delta: -4.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.20ms. Allocated memory is still 88.1MB. Free memory was 49.1MB in the beginning and 46.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 88.1MB. Free memory was 46.1MB in the beginning and 43.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 424.67ms. Allocated memory is still 88.1MB. Free memory was 43.6MB in the beginning and 53.3MB in the end (delta: -9.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1368.47ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 58.8MB in the end (delta: -6.2MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 8.00ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 58.2MB in the end (delta: 619.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1567. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_13_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE GLOBAL_CONST_FIVE==5 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] [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 41 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-17 06:20:35,767 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