./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_04_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_04_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 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:20:05,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:20:05,138 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:05,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:20:05,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:20:05,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:20:05,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:20:05,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:20:05,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:20:05,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:20:05,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:20:05,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:20:05,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:20:05,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:20:05,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:20:05,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:20:05,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:20:05,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 06:20:05,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:20:05,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:20:05,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:20:05,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:20:05,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:20:05,182 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:20:05,183 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:20:05,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:20:05,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:20:05,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:20:05,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:20:05,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:20:05,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:20:05,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:05,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:20:05,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:20:05,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:20:05,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 06:20:05,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 06:20:05,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:20:05,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:20:05,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:20:05,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:20:05,187 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 -> 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 [2024-11-17 06:20:05,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:20:05,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:20:05,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:20:05,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:20:05,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:20:05,464 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_04_bad.i [2024-11-17 06:20:06,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:20:07,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:20:07,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_04_bad.i [2024-11-17 06:20:07,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c3bd3be/9ac06f58e14b43848700a6a583e7933b/FLAG4b0971af9 [2024-11-17 06:20:07,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c3bd3be/9ac06f58e14b43848700a6a583e7933b [2024-11-17 06:20:07,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:20:07,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:20:07,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:07,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:20:07,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:20:07,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:07" (1/1) ... [2024-11-17 06:20:07,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3791cdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:07, skipping insertion in model container [2024-11-17 06:20:07,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:07" (1/1) ... [2024-11-17 06:20:07,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:20:08,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:08,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:20:08,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:08,628 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:20:08,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:08 WrapperNode [2024-11-17 06:20:08,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:08,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:08,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:20:08,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:20:08,638 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:08" (1/1) ... [2024-11-17 06:20:08,671 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:08" (1/1) ... [2024-11-17 06:20:08,742 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-17 06:20:08,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:08,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:20:08,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:20:08,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:20:08,754 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:08" (1/1) ... [2024-11-17 06:20:08,754 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:08" (1/1) ... [2024-11-17 06:20:08,757 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:08" (1/1) ... [2024-11-17 06:20:08,776 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:20:08,780 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:08" (1/1) ... [2024-11-17 06:20:08,781 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:08" (1/1) ... [2024-11-17 06:20:08,785 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:08" (1/1) ... [2024-11-17 06:20:08,785 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:08" (1/1) ... [2024-11-17 06:20:08,786 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:08" (1/1) ... [2024-11-17 06:20:08,789 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:08" (1/1) ... [2024-11-17 06:20:08,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:20:08,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:20:08,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:20:08,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:20:08,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:08" (1/1) ... [2024-11-17 06:20:08,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:20:08,838 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:08,842 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:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:20:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:20:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:20:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:20:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:20:09,062 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:20:09,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:20:09,303 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-17 06:20:09,303 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:20:09,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:20:09,336 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:20:09,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:09 BoogieIcfgContainer [2024-11-17 06:20:09,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:20:09,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:20:09,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:20:09,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:20:09,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:20:07" (1/3) ... [2024-11-17 06:20:09,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:09, skipping insertion in model container [2024-11-17 06:20:09,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:08" (2/3) ... [2024-11-17 06:20:09,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:09, skipping insertion in model container [2024-11-17 06:20:09,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:09" (3/3) ... [2024-11-17 06:20:09,348 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_04_bad.i [2024-11-17 06:20:09,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:20:09,366 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 06:20:09,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:20:09,447 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;@2752276f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:20:09,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 06:20:09,452 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:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:20:09,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:09,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:09,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1097144348, now seen corresponding path program 1 times [2024-11-17 06:20:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491391047] [2024-11-17 06:20:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:09,913 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:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491391047] [2024-11-17 06:20:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491391047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 06:20:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158027875] [2024-11-17 06:20:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 06:20:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 06:20:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 06:20:09,956 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 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:10,145 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2024-11-17 06:20:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 06:20:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:10,157 INFO L225 Difference]: With dead ends: 89 [2024-11-17 06:20:10,157 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 06:20:10,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 06:20:10,166 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 114 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 06:20:10,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 181 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 06:20:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 06:20:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 06:20:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.4375) internal successors, (46), 33 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:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-17 06:20:10,201 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 11 [2024-11-17 06:20:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-17 06:20:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-17 06:20:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 06:20:10,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:10,203 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:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 06:20:10,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:10,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1163138986, now seen corresponding path program 1 times [2024-11-17 06:20:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527441191] [2024-11-17 06:20:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:10,519 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:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527441191] [2024-11-17 06:20:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527441191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 06:20:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100993110] [2024-11-17 06:20:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 06:20:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 06:20:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 06:20:10,528 INFO L87 Difference]: Start difference. First operand 36 states and 48 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:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:10,645 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-17 06:20:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 06:20:10,646 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:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:10,647 INFO L225 Difference]: With dead ends: 42 [2024-11-17 06:20:10,648 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 06:20:10,649 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:10,650 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 142 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:10,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 142 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:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 06:20:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-17 06:20:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-17 06:20:10,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 17 [2024-11-17 06:20:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:10,659 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-17 06:20:10,659 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:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-17 06:20:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 06:20:10,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:10,661 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:10,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 06:20:10,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:10,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 161564535, now seen corresponding path program 1 times [2024-11-17 06:20:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:10,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866390581] [2024-11-17 06:20:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:20:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:10,769 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:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:20:10,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866390581] [2024-11-17 06:20:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866390581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:10,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:10,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:20:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942431840] [2024-11-17 06:20:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:10,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:20:10,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:20:10,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:20:10,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:20:10,772 INFO L87 Difference]: Start difference. First operand 40 states and 52 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:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:10,788 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-17 06:20:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:20:10,789 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:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:10,790 INFO L225 Difference]: With dead ends: 40 [2024-11-17 06:20:10,790 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 06:20:10,791 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:10,792 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 48 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:10,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 48 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:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 06:20:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-17 06:20:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-17 06:20:10,804 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 17 [2024-11-17 06:20:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:10,804 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-17 06:20:10,805 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:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-17 06:20:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 06:20:10,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:10,806 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:10,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 06:20:10,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:10,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1697570179, now seen corresponding path program 1 times [2024-11-17 06:20:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:20:10,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281402475] [2024-11-17 06:20:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:20:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:10,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:20:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:10,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 06:20:10,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:20:10,882 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 06:20:10,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 06:20:10,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 06:20:10,889 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 06:20:10,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:20:10,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:20:10 BoogieIcfgContainer [2024-11-17 06:20:10,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:20:10,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:20:10,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:20:10,925 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:20:10,927 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:09" (3/4) ... [2024-11-17 06:20:10,930 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:20:10,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:20:10,933 INFO L158 Benchmark]: Toolchain (without parser) took 3429.73ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 119.0MB in the beginning and 134.2MB in the end (delta: -15.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,933 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:10,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1124.04ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.22ms. Allocated memory is still 153.1MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,938 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 153.1MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:10,939 INFO L158 Benchmark]: IcfgBuilder took 546.09ms. Allocated memory is still 153.1MB. Free memory was 112.0MB in the beginning and 94.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,939 INFO L158 Benchmark]: TraceAbstraction took 1584.60ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 93.2MB in the beginning and 135.3MB in the end (delta: -42.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,939 INFO L158 Benchmark]: Witness Printer took 6.33ms. Allocated memory is still 218.1MB. Free memory was 135.3MB in the beginning and 134.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:10,941 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.19ms. Allocated memory is still 153.1MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1124.04ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.22ms. Allocated memory is still 153.1MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 153.1MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.09ms. Allocated memory is still 153.1MB. Free memory was 112.0MB in the beginning and 94.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1584.60ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 93.2MB in the beginning and 135.3MB in the end (delta: -42.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Witness Printer took 6.33ms. Allocated memory is still 218.1MB. Free memory was 135.3MB in the beginning and 134.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1561]: 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 1569. 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); [L1548] static const int STATIC_CONST_TRUE = 1; [L1549] static const int STATIC_CONST_FALSE = 0; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_add_04_bad() [L1552] int data; [L1553] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] COND TRUE \read(STATIC_CONST_TRUE) [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] 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, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1558] COND TRUE \read(STATIC_CONST_TRUE) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1561] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1561]: 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.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 124 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 16, 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.7s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 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:10,977 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_04_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 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:20:13,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:20:13,310 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:13,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:20:13,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:20:13,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 06:20:13,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:20:13,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:20:13,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:20:13,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:20:13,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:20:13,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:20:13,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:20:13,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:20:13,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:20:13,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:20:13,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:20:13,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:20:13,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:20:13,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:20:13,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:20:13,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:20:13,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 06:20:13,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 06:20:13,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:20:13,355 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:20:13,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 06:20:13,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:20:13,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:20:13,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:20:13,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:20:13,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:20:13,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:20:13,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:20:13,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:13,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:20:13,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:20:13,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:20:13,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 06:20:13,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 06:20:13,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:20:13,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:20:13,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:20:13,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:20:13,367 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 -> 3c3ce8348995b831aa1433d89fb0ec380ad3ea35819fcc75e231cc181816b768 [2024-11-17 06:20:13,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:20:13,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:20:13,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:20:13,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:20:13,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:20:13,741 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_04_bad.i [2024-11-17 06:20:15,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:20:15,721 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:20:15,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_04_bad.i [2024-11-17 06:20:15,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bceaf93/5106797eb4fc42f7ae240b627bdd123e/FLAG0dcf207b1 [2024-11-17 06:20:15,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bceaf93/5106797eb4fc42f7ae240b627bdd123e [2024-11-17 06:20:15,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:20:15,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:20:15,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:15,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:20:15,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:20:15,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:15" (1/1) ... [2024-11-17 06:20:15,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42415600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:15, skipping insertion in model container [2024-11-17 06:20:15,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:20:15" (1/1) ... [2024-11-17 06:20:15,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:20:16,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:16,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:20:16,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:20:16,872 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:20:16,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:16 WrapperNode [2024-11-17 06:20:16,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:20:16,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:16,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:20:16,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:20:16,881 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:16" (1/1) ... [2024-11-17 06:20:16,911 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:16" (1/1) ... [2024-11-17 06:20:16,943 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-17 06:20:16,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:20:16,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:20:16,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:20:16,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:20:16,956 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:16" (1/1) ... [2024-11-17 06:20:16,956 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:16" (1/1) ... [2024-11-17 06:20:16,963 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:16" (1/1) ... [2024-11-17 06:20:16,987 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:20:16,991 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:16" (1/1) ... [2024-11-17 06:20:16,992 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:16" (1/1) ... [2024-11-17 06:20:17,004 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:16" (1/1) ... [2024-11-17 06:20:17,004 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:16" (1/1) ... [2024-11-17 06:20:17,010 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:16" (1/1) ... [2024-11-17 06:20:17,016 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:16" (1/1) ... [2024-11-17 06:20:17,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:20:17,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:20:17,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:20:17,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:20:17,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:16" (1/1) ... [2024-11-17 06:20:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:20:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:20:17,062 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:17,066 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:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:20:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:20:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:20:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:20:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:20:17,295 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:20:17,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:20:17,492 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-17 06:20:17,492 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:20:17,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:20:17,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:20:17,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:17 BoogieIcfgContainer [2024-11-17 06:20:17,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:20:17,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:20:17,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:20:17,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:20:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:20:15" (1/3) ... [2024-11-17 06:20:17,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41311340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:17, skipping insertion in model container [2024-11-17 06:20:17,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:20:16" (2/3) ... [2024-11-17 06:20:17,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41311340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:20:17, skipping insertion in model container [2024-11-17 06:20:17,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:20:17" (3/3) ... [2024-11-17 06:20:17,518 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_04_bad.i [2024-11-17 06:20:17,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:20:17,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 06:20:17,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:20:17,611 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;@5a33a117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:20:17,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 06:20:17,616 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:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:20:17,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:17,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:17,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 456932820, now seen corresponding path program 1 times [2024-11-17 06:20:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325699361] [2024-11-17 06:20:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:17,646 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:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:17,650 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:17,651 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:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:17,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 06:20:17,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:20:17,784 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:17,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:20:17,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:20:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325699361] [2024-11-17 06:20:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325699361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:17,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 06:20:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81630995] [2024-11-17 06:20:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 06:20:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:20:17,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 06:20:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 06:20:17,822 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:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:17,851 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-17 06:20:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 06:20:17,853 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:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:17,861 INFO L225 Difference]: With dead ends: 24 [2024-11-17 06:20:17,861 INFO L226 Difference]: Without dead ends: 15 [2024-11-17 06:20:17,864 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:17,870 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:17,871 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:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-17 06:20:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 06:20:17,904 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:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-17 06:20:17,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-17 06:20:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 06:20:17,909 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:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-17 06:20:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 06:20:17,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:17,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:17,915 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:18,113 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:18,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:18,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1280015513, now seen corresponding path program 1 times [2024-11-17 06:20:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189647461] [2024-11-17 06:20:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:18,117 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:18,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:18,120 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:18,121 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:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:20:18,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 06:20:18,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:20:18,249 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:18,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:20:18,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:20:18,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189647461] [2024-11-17 06:20:18,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189647461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:20:18,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:20:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 06:20:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534289246] [2024-11-17 06:20:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:20:18,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:20:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:20:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:20:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:20:18,256 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:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:20:18,265 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-17 06:20:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:20:18,266 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:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:20:18,267 INFO L225 Difference]: With dead ends: 19 [2024-11-17 06:20:18,268 INFO L226 Difference]: Without dead ends: 15 [2024-11-17 06:20:18,268 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:18,269 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:18,271 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:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-17 06:20:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 06:20:18,276 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:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-17 06:20:18,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-17 06:20:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:20:18,278 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-17 06:20:18,279 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:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-17 06:20:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 06:20:18,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:20:18,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:20:18,283 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:18,480 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:18,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 06:20:18,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:20:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1708525211, now seen corresponding path program 1 times [2024-11-17 06:20:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:20:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880213093] [2024-11-17 06:20:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:20:18,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:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:20:18,486 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:18,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 (4)] Waiting until timeout for monitored process [2024-11-17 06:20:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:18,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:20:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:20:18,633 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 06:20:18,634 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:20:18,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 06:20:18,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 06:20:18,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 06:20:18,839 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:18,842 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 06:20:18,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:20:18,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:20:18 BoogieIcfgContainer [2024-11-17 06:20:18,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:20:18,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:20:18,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:20:18,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:20:18,875 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:17" (3/4) ... [2024-11-17 06:20:18,877 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:20:18,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:20:18,879 INFO L158 Benchmark]: Toolchain (without parser) took 3099.57ms. Allocated memory was 56.6MB in the beginning and 90.2MB in the end (delta: 33.6MB). Free memory was 34.3MB in the beginning and 38.1MB in the end (delta: -3.8MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,880 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 44.0MB. Free memory was 27.0MB in the beginning and 26.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:18,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1092.18ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 41.0MB in the end (delta: -6.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.91ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,884 INFO L158 Benchmark]: Boogie Preprocessor took 79.27ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,884 INFO L158 Benchmark]: IcfgBuilder took 483.52ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 38.1MB in the end (delta: -2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,885 INFO L158 Benchmark]: TraceAbstraction took 1362.57ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 37.7MB in the beginning and 38.6MB in the end (delta: -900.4kB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-17 06:20:18,885 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 90.2MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:20:18,887 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 44.0MB. Free memory was 27.0MB in the beginning and 26.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1092.18ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 41.0MB in the end (delta: -6.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.91ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.27ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 483.52ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 38.1MB in the end (delta: -2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1362.57ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 37.7MB in the beginning and 38.6MB in the end (delta: -900.4kB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 90.2MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1561]: 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 1569. 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); [L1548] static const int STATIC_CONST_TRUE = 1; [L1549] static const int STATIC_CONST_FALSE = 0; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_add_04_bad() [L1552] int data; [L1553] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] COND TRUE \read(STATIC_CONST_TRUE) [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1556] 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, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1558] COND TRUE \read(STATIC_CONST_TRUE) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1561] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, STATIC_CONST_FALSE=0, STATIC_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1561]: 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.3s, 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, 79 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:18,917 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