./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d773a141845241c980bc63a8ce070e4fe927437db7ca2c09cb4361f9c9affb8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:31:36,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:31:36,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:31:36,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:31:36,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:31:36,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:31:36,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:31:36,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:31:36,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:31:36,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:31:36,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:31:36,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:31:36,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:31:36,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:31:36,582 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:31:36,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:31:36,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:31:36,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:31:36,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:31:36,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:31:36,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:31:36,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:31:36,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:31:36,588 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:31:36,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:31:36,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:31:36,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:31:36,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:31:36,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:31:36,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:31:36,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:31:36,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:36,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:31:36,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:31:36,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:31:36,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:31:36,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:31:36,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:31:36,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:31:36,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:31:36,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:31:36,593 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-clean/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-clean/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 -> d773a141845241c980bc63a8ce070e4fe927437db7ca2c09cb4361f9c9affb8c [2024-10-11 22:31:36,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:31:36,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:31:36,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:31:36,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:31:36,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:31:36,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:38,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:31:38,694 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:31:38,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:38,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf2ed1d90/556cabad42fb45988d4f278ac1ab1ca1/FLAG6438be8b6 [2024-10-11 22:31:38,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf2ed1d90/556cabad42fb45988d4f278ac1ab1ca1 [2024-10-11 22:31:38,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:31:38,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:31:38,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:38,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:31:38,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:31:38,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:38" (1/1) ... [2024-10-11 22:31:38,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f4cd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:38, skipping insertion in model container [2024-10-11 22:31:38,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:38" (1/1) ... [2024-10-11 22:31:38,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:31:39,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:39,572 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:31:39,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:39,838 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:31:39,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39 WrapperNode [2024-10-11 22:31:39,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:39,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:39,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:31:39,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:31:39,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,905 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2024-10-11 22:31:39,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:39,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:31:39,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:31:39,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:31:39,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,930 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:31:39,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:31:39,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:31:39,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:31:39,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:31:39,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (1/1) ... [2024-10-11 22:31:39,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:31:39,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:31:40,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:31:40,045 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:31:40,045 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:31:40,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:31:40,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:31:40,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:31:40,224 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:31:40,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:31:40,459 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-10-11 22:31:40,459 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:31:40,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:31:40,495 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:31:40,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:40 BoogieIcfgContainer [2024-10-11 22:31:40,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:31:40,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:31:40,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:31:40,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:31:40,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:31:38" (1/3) ... [2024-10-11 22:31:40,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2009717e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:40, skipping insertion in model container [2024-10-11 22:31:40,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:39" (2/3) ... [2024-10-11 22:31:40,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2009717e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:40, skipping insertion in model container [2024-10-11 22:31:40,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:40" (3/3) ... [2024-10-11 22:31:40,507 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:40,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:31:40,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:31:40,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:31:40,583 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;@574f26b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:31:40,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:31:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 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-10-11 22:31:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 22:31:40,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:40,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:40,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1238243443, now seen corresponding path program 1 times [2024-10-11 22:31:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727934181] [2024-10-11 22:31:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:31:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:41,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:31:41,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727934181] [2024-10-11 22:31:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727934181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:31:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721998307] [2024-10-11 22:31:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:41,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:31:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:31:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:31:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:31:41,149 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 22:31:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:41,188 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2024-10-11 22:31:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:31:41,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-11 22:31:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:41,198 INFO L225 Difference]: With dead ends: 36 [2024-10-11 22:31:41,198 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 22:31:41,202 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-10-11 22:31:41,207 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:41,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:31:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 22:31:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 22:31:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 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-10-11 22:31:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-11 22:31:41,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 14 [2024-10-11 22:31:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-11 22:31:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 22:31:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-11 22:31:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 22:31:41,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:41,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:31:41,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash 269159056, now seen corresponding path program 1 times [2024-10-11 22:31:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330790688] [2024-10-11 22:31:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:31:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:41,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:31:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330790688] [2024-10-11 22:31:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330790688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 22:31:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69337316] [2024-10-11 22:31:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 22:31:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:31:41,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 22:31:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:31:41,552 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-10-11 22:31:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:41,612 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-11 22:31:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 22:31:41,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2024-10-11 22:31:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:41,613 INFO L225 Difference]: With dead ends: 37 [2024-10-11 22:31:41,613 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 22:31:41,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:31:41,614 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:41,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:31:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 22:31:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 22:31:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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-10-11 22:31:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-10-11 22:31:41,624 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2024-10-11 22:31:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:41,625 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-10-11 22:31:41,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-10-11 22:31:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-10-11 22:31:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 22:31:41,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:41,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:41,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:31:41,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2022659338, now seen corresponding path program 1 times [2024-10-11 22:31:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:31:41,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309067188] [2024-10-11 22:31:41,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:31:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:41,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:31:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:41,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 22:31:41,700 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:31:41,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:31:41,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:31:41,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:31:41,706 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 22:31:41,732 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:31:41,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:31:41 BoogieIcfgContainer [2024-10-11 22:31:41,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:31:41,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:31:41,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:31:41,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:31:41,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:40" (3/4) ... [2024-10-11 22:31:41,742 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:31:41,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:31:41,744 INFO L158 Benchmark]: Toolchain (without parser) took 2999.04ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 72.6MB in the end (delta: 44.4MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,745 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:41,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1091.86ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 100.8MB in the end (delta: 16.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.99ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 97.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,746 INFO L158 Benchmark]: Boogie Preprocessor took 41.69ms. Allocated memory is still 172.0MB. Free memory was 97.8MB in the beginning and 95.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,747 INFO L158 Benchmark]: RCFGBuilder took 547.92ms. Allocated memory is still 172.0MB. Free memory was 95.7MB in the beginning and 76.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,747 INFO L158 Benchmark]: TraceAbstraction took 1238.65ms. Allocated memory is still 172.0MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:41,750 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 172.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:41,752 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.16ms. Allocated memory is still 94.4MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1091.86ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 100.8MB in the end (delta: 16.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.99ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 97.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.69ms. Allocated memory is still 172.0MB. Free memory was 97.8MB in the beginning and 95.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.92ms. Allocated memory is still 172.0MB. Free memory was 95.7MB in the beginning and 76.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1238.65ms. Allocated memory is still 172.0MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 172.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1551]: 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 1566. 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); [L1566] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1566] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL CWE190_Integer_Overflow__int_rand_add_44_bad() [L1557] int data; [L1558] void (*funcPtr) (int) = badSink; [L1559] data = 0 [L1560] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1560] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, funcPtr={-1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, funcPtr={-1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] 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, funcPtr={-1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1561] CALL funcPtr(data) [L1551] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1551]: 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, 36 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 79 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-10-11 22:31:41,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d773a141845241c980bc63a8ce070e4fe927437db7ca2c09cb4361f9c9affb8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:31:44,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:31:44,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:31:44,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:31:44,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:31:44,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:31:44,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:31:44,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:31:44,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:31:44,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:31:44,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:31:44,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:31:44,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:31:44,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:31:44,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:31:44,175 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:31:44,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:31:44,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:31:44,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:31:44,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:31:44,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:31:44,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:31:44,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:31:44,180 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:31:44,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:31:44,180 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:31:44,184 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:31:44,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:31:44,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:31:44,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:31:44,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:31:44,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:31:44,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:31:44,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:31:44,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:44,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:31:44,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:31:44,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:31:44,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:31:44,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:31:44,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:31:44,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:31:44,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:31:44,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:31:44,190 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:31:44,190 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-clean/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-clean/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 -> d773a141845241c980bc63a8ce070e4fe927437db7ca2c09cb4361f9c9affb8c [2024-10-11 22:31:44,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:31:44,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:31:44,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:31:44,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:31:44,522 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:31:44,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:46,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:31:46,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:31:46,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:46,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad1d294e7/62078055f883445ab93a0bd453df6eaa/FLAGb04cb805f [2024-10-11 22:31:46,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad1d294e7/62078055f883445ab93a0bd453df6eaa [2024-10-11 22:31:46,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:31:46,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:31:46,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:46,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:31:46,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:31:46,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:46" (1/1) ... [2024-10-11 22:31:46,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549ecf95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:46, skipping insertion in model container [2024-10-11 22:31:46,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:31:46" (1/1) ... [2024-10-11 22:31:46,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:31:47,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:47,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:31:47,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:31:47,905 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:31:47,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47 WrapperNode [2024-10-11 22:31:47,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:31:47,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:47,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:31:47,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:31:47,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,970 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 62 [2024-10-11 22:31:47,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:31:47,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:31:47,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:31:47,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:31:47,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:47,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,002 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:31:48,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:31:48,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:31:48,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:31:48,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:31:48,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (1/1) ... [2024-10-11 22:31:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:31:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:31:48,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:31:48,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:31:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:31:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:31:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:31:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:31:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:31:48,266 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:31:48,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:31:48,415 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 22:31:48,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:31:48,482 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:31:48,482 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:31:48,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:48 BoogieIcfgContainer [2024-10-11 22:31:48,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:31:48,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:31:48,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:31:48,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:31:48,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:31:46" (1/3) ... [2024-10-11 22:31:48,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912de6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:48, skipping insertion in model container [2024-10-11 22:31:48,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:31:47" (2/3) ... [2024-10-11 22:31:48,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912de6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:31:48, skipping insertion in model container [2024-10-11 22:31:48,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:48" (3/3) ... [2024-10-11 22:31:48,492 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_44_bad.i [2024-10-11 22:31:48,508 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:31:48,509 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 22:31:48,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:31:48,574 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;@4c1be584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:31:48,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 22:31:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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-10-11 22:31:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 22:31:48,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:48,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:48,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:48,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1406533342, now seen corresponding path program 1 times [2024-10-11 22:31:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:31:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360830220] [2024-10-11 22:31:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:48,608 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-10-11 22:31:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:31:48,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 22:31:48,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:31:48,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:31:48,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:31:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:31:48,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:31:48,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:31:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360830220] [2024-10-11 22:31:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360830220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:31:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:31:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:31:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154946177] [2024-10-11 22:31:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:31:48,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:31:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:31:48,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:31:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:31:48,785 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-11 22:31:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:31:48,812 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-11 22:31:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:31:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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 10 [2024-10-11 22:31:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:31:48,820 INFO L225 Difference]: With dead ends: 16 [2024-10-11 22:31:48,821 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 22:31:48,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-10-11 22:31:48,827 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:31:48,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:31:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 22:31:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 22:31:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-10-11 22:31:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-11 22:31:48,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-10-11 22:31:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:31:48,866 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-11 22:31:48,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-11 22:31:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-11 22:31:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:31:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:31:48,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:31:48,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:49,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 22:31:49,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-11 22:31:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:31:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -652860589, now seen corresponding path program 1 times [2024-10-11 22:31:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:31:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888325754] [2024-10-11 22:31:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:31:49,071 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-10-11 22:31:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:31:49,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 22:31:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:49,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:31:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:31:49,236 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 22:31:49,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:31:49,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-11 22:31:49,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-11 22:31:49,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:31:49,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 22:31:49,444 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 22:31:49,485 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:31:49,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:31:49 BoogieIcfgContainer [2024-10-11 22:31:49,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:31:49,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:31:49,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:31:49,494 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:31:49,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:31:48" (3/4) ... [2024-10-11 22:31:49,496 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:31:49,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:31:49,502 INFO L158 Benchmark]: Toolchain (without parser) took 2878.82ms. Allocated memory was 67.1MB in the beginning and 109.1MB in the end (delta: 41.9MB). Free memory was 39.6MB in the beginning and 78.5MB in the end (delta: -38.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,502 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 41.9MB. Free memory was 18.5MB in the beginning and 18.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:49,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1282.61ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 39.4MB in the beginning and 49.8MB in the end (delta: -10.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.39ms. Allocated memory is still 83.9MB. Free memory was 49.8MB in the beginning and 46.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,522 INFO L158 Benchmark]: Boogie Preprocessor took 50.92ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 44.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,522 INFO L158 Benchmark]: RCFGBuilder took 459.34ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 55.1MB in the end (delta: -11.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,523 INFO L158 Benchmark]: TraceAbstraction took 1008.18ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 54.5MB in the beginning and 78.6MB in the end (delta: -24.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-10-11 22:31:49,523 INFO L158 Benchmark]: Witness Printer took 7.42ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 61.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:31:49,529 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.17ms. Allocated memory is still 41.9MB. Free memory was 18.5MB in the beginning and 18.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1282.61ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 39.4MB in the beginning and 49.8MB in the end (delta: -10.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.39ms. Allocated memory is still 83.9MB. Free memory was 49.8MB in the beginning and 46.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.92ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 44.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.34ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 55.1MB in the end (delta: -11.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1008.18ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 54.5MB in the beginning and 78.6MB in the end (delta: -24.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Witness Printer took 7.42ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 61.6kB). 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: 1551]: 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 1566. 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); [L1566] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1566] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] CALL CWE190_Integer_Overflow__int_rand_add_44_bad() [L1557] int data; [L1558] void (*funcPtr) (int) = badSink; [L1559] data = 0 [L1560] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1560] 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, funcPtr={-1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1561] CALL funcPtr(data) [L1551] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1551]: 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, 16 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-10-11 22:31:49,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample