./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d3e1f6b51e5dfdc3eb8550ca99bcbbded262663a38c9229a88131062f5463937 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:26:03,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:26:03,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 14:26:03,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:26:03,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:26:03,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:26:03,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:26:03,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:26:03,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:26:03,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:26:03,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:26:03,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:26:03,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:26:03,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:26:04,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:26:04,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:26:04,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:26:04,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:26:04,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:26:04,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:26:04,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:26:04,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:26:04,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:26:04,002 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:26:04,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:26:04,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:26:04,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:26:04,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:26:04,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:26:04,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:26:04,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:26:04,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:26:04,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:26:04,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:26:04,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:26:04,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:26:04,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:26:04,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:26:04,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:26:04,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:26:04,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:26:04,006 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3e1f6b51e5dfdc3eb8550ca99bcbbded262663a38c9229a88131062f5463937 [2024-11-09 14:26:04,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:26:04,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:26:04,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:26:04,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:26:04,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:26:04,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:05,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:26:05,789 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:26:05,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:05,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29642c52/88ec6a7d54ce47ffbd8b05b10bcc4ffc/FLAG7eb29d727 [2024-11-09 14:26:06,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29642c52/88ec6a7d54ce47ffbd8b05b10bcc4ffc [2024-11-09 14:26:06,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:26:06,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:26:06,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:26:06,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:26:06,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:26:06,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:26:06" (1/1) ... [2024-11-09 14:26:06,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39287ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:06, skipping insertion in model container [2024-11-09 14:26:06,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:26:06" (1/1) ... [2024-11-09 14:26:06,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:26:06,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:26:06,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:26:06,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:26:07,050 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:26:07,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07 WrapperNode [2024-11-09 14:26:07,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:26:07,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:26:07,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:26:07,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:26:07,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,113 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-09 14:26:07,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:26:07,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:26:07,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:26:07,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:26:07,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,151 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 14:26:07,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:26:07,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:26:07,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:26:07,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:26:07,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (1/1) ... [2024-11-09 14:26:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:26:07,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:26:07,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:26:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:26:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-09 14:26:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-09 14:26:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-09 14:26:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-09 14:26:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:26:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:26:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:26:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:26:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:26:07,360 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:26:07,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:26:07,567 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-09 14:26:07,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:26:07,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:26:07,577 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:26:07,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:07 BoogieIcfgContainer [2024-11-09 14:26:07,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:26:07,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:26:07,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:26:07,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:26:07,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:26:06" (1/3) ... [2024-11-09 14:26:07,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581032ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:26:07, skipping insertion in model container [2024-11-09 14:26:07,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:07" (2/3) ... [2024-11-09 14:26:07,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581032ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:26:07, skipping insertion in model container [2024-11-09 14:26:07,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:07" (3/3) ... [2024-11-09 14:26:07,584 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:07,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:26:07,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 14:26:07,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:26:07,648 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;@5f1d45bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:26:07,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 14:26:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 54 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 14:26:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 14:26:07,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:07,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:07,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:07,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -709036732, now seen corresponding path program 1 times [2024-11-09 14:26:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:26:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191504260] [2024-11-09 14:26:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:26:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:26:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:26:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:26:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:26:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:26:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191504260] [2024-11-09 14:26:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191504260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:26:08,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:26:08,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:26:08,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174556883] [2024-11-09 14:26:08,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:26:08,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:26:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:26:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:26:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:08,087 INFO L87 Difference]: Start difference. First operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 54 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:26:08,139 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2024-11-09 14:26:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:26:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 14:26:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:26:08,146 INFO L225 Difference]: With dead ends: 89 [2024-11-09 14:26:08,147 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 14:26:08,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:08,151 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:26:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 146 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:26:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 14:26:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-09 14:26:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 51 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 14:26:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-11-09 14:26:08,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 22 [2024-11-09 14:26:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:26:08,181 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-11-09 14:26:08,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-11-09 14:26:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 14:26:08,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:08,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:08,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:26:08,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -505302067, now seen corresponding path program 1 times [2024-11-09 14:26:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:26:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011790984] [2024-11-09 14:26:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:26:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:26:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:26:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:26:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:26:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:26:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011790984] [2024-11-09 14:26:08,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011790984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:26:08,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:26:08,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:26:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542168461] [2024-11-09 14:26:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:26:08,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:26:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:26:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:26:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:08,318 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:26:08,355 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-11-09 14:26:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:26:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-09 14:26:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:26:08,357 INFO L225 Difference]: With dead ends: 62 [2024-11-09 14:26:08,357 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 14:26:08,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:08,358 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:26:08,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:26:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 14:26:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 14:26:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 44 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 14:26:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-09 14:26:08,374 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 23 [2024-11-09 14:26:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:26:08,374 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-09 14:26:08,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-09 14:26:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 14:26:08,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:08,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:08,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 14:26:08,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:08,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash 470645345, now seen corresponding path program 1 times [2024-11-09 14:26:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:26:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925270850] [2024-11-09 14:26:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:26:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 14:26:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 14:26:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 14:26:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:26:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:26:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925270850] [2024-11-09 14:26:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925270850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:26:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:26:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:26:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43296075] [2024-11-09 14:26:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:26:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:26:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:26:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:26:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:26:08,666 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:26:08,781 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-11-09 14:26:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:26:08,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 14:26:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:26:08,782 INFO L225 Difference]: With dead ends: 66 [2024-11-09 14:26:08,782 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 14:26:08,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-11-09 14:26:08,783 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:26:08,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 265 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:26:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 14:26:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 14:26:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 14:26:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-09 14:26:08,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 28 [2024-11-09 14:26:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:26:08,793 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 14:26:08,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-11-09 14:26:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 14:26:08,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:08,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:08,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:26:08,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:08,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:08,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1952170373, now seen corresponding path program 1 times [2024-11-09 14:26:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:26:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584201849] [2024-11-09 14:26:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:08,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:26:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:26:08,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:26:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:26:08,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 14:26:08,862 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:26:08,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 14:26:08,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 14:26:08,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 14:26:08,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 14:26:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:26:08,867 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 14:26:08,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:26:08,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:26:08 BoogieIcfgContainer [2024-11-09 14:26:08,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:26:08,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:26:08,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:26:08,894 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:26:08,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:07" (3/4) ... [2024-11-09 14:26:08,899 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:26:08,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:26:08,901 INFO L158 Benchmark]: Toolchain (without parser) took 2825.48ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 95.9MB in the beginning and 115.2MB in the end (delta: -19.4MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,901 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:26:08,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 974.93ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.63ms. Allocated memory is still 169.9MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,902 INFO L158 Benchmark]: Boogie Preprocessor took 61.42ms. Allocated memory is still 169.9MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,902 INFO L158 Benchmark]: RCFGBuilder took 399.53ms. Allocated memory is still 169.9MB. Free memory was 77.0MB in the beginning and 58.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,902 INFO L158 Benchmark]: TraceAbstraction took 1313.80ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 57.5MB in the beginning and 115.2MB in the end (delta: -57.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 14:26:08,902 INFO L158 Benchmark]: Witness Printer took 6.51ms. Allocated memory is still 237.0MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:26:08,905 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.15ms. Allocated memory is still 169.9MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 974.93ms. Allocated memory is still 169.9MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.63ms. Allocated memory is still 169.9MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.42ms. Allocated memory is still 169.9MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.53ms. Allocated memory is still 169.9MB. Free memory was 77.0MB in the beginning and 58.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1313.80ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 57.5MB in the beginning and 115.2MB in the end (delta: -57.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Witness Printer took 6.51ms. Allocated memory is still 237.0MB. Free memory is still 115.2MB. 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: 1564]: 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 1587. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1587] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1587] 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] [L1588] CALL CWE191_Integer_Underflow__int_rand_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1562] COND TRUE data < 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] data * 2 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: 1564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 65 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 525 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 192 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:26:08,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d3e1f6b51e5dfdc3eb8550ca99bcbbded262663a38c9229a88131062f5463937 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:26:11,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:26:11,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 14:26:11,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:26:11,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:26:11,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 14:26:11,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:26:11,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:26:11,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:26:11,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:26:11,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:26:11,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:26:11,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:26:11,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:26:11,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:26:11,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:26:11,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:26:11,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:26:11,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:26:11,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:26:11,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:26:11,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:26:11,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 14:26:11,267 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 14:26:11,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:26:11,267 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:26:11,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 14:26:11,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:26:11,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:26:11,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:26:11,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:26:11,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:26:11,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:26:11,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 14:26:11,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 14:26:11,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:26:11,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:26:11,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:26:11,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:26:11,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3e1f6b51e5dfdc3eb8550ca99bcbbded262663a38c9229a88131062f5463937 [2024-11-09 14:26:11,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:26:11,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:26:11,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:26:11,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:26:11,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:26:11,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:13,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:26:13,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:26:13,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:13,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744109ea0/0819992d57c94791b18caaa4c6f7b7e3/FLAG787b8b8a8 [2024-11-09 14:26:13,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744109ea0/0819992d57c94791b18caaa4c6f7b7e3 [2024-11-09 14:26:13,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:26:13,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:26:13,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:26:13,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:26:13,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:26:13,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:26:13" (1/1) ... [2024-11-09 14:26:13,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1ce73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:13, skipping insertion in model container [2024-11-09 14:26:13,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:26:13" (1/1) ... [2024-11-09 14:26:13,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:26:13,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:26:13,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:26:14,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:26:14,157 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:26:14,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14 WrapperNode [2024-11-09 14:26:14,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:26:14,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:26:14,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:26:14,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:26:14,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,203 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-11-09 14:26:14,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:26:14,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:26:14,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:26:14,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:26:14,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,230 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 14:26:14,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:26:14,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:26:14,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:26:14,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:26:14,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (1/1) ... [2024-11-09 14:26:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:26:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:26:14,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:26:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:26:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-09 14:26:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-09 14:26:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-09 14:26:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-09 14:26:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 14:26:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 14:26:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:26:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:26:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:26:14,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:26:14,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:26:14,536 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 14:26:14,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:26:14,547 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:26:14,547 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 14:26:14,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:14 BoogieIcfgContainer [2024-11-09 14:26:14,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:26:14,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:26:14,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:26:14,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:26:14,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:26:13" (1/3) ... [2024-11-09 14:26:14,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e11615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:26:14, skipping insertion in model container [2024-11-09 14:26:14,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:26:14" (2/3) ... [2024-11-09 14:26:14,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e11615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:26:14, skipping insertion in model container [2024-11-09 14:26:14,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:14" (3/3) ... [2024-11-09 14:26:14,555 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_12_bad.i [2024-11-09 14:26:14,580 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:26:14,580 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 14:26:14,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:26:14,636 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;@49e9df09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:26:14,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 14:26:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 14:26:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 14:26:14,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:14,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:14,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1361619194, now seen corresponding path program 1 times [2024-11-09 14:26:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:26:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694846658] [2024-11-09 14:26:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:26:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:26:14,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:26:14,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 14:26:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:26:14,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:26:14,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:26:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:26:14,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:26:14,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:26:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694846658] [2024-11-09 14:26:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694846658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:26:14,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:26:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:26:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637813321] [2024-11-09 14:26:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:26:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:26:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:26:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:26:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:14,875 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:26:14,959 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2024-11-09 14:26:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:26:14,963 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-09 14:26:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:26:14,968 INFO L225 Difference]: With dead ends: 68 [2024-11-09 14:26:14,968 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 14:26:14,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:26:14,975 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:26:14,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 92 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:26:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 14:26:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 14:26:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 14:26:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-09 14:26:15,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2024-11-09 14:26:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:26:15,004 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-09 14:26:15,005 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:26:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 14:26:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 14:26:15,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:26:15,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:26:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 14:26:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:26:15,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 14:26:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:26:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 22101195, now seen corresponding path program 1 times [2024-11-09 14:26:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:26:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198037028] [2024-11-09 14:26:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:26:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:26:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:26:15,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 14:26:15,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 14:26:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:26:15,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:26:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:26:15,346 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 14:26:15,346 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:26:15,348 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 14:26:15,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 14:26:15,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 14:26:15,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 14:26:15,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 14:26:15,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 14:26:15,553 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 14:26:15,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:26:15,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:26:15 BoogieIcfgContainer [2024-11-09 14:26:15,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:26:15,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:26:15,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:26:15,621 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:26:15,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:26:14" (3/4) ... [2024-11-09 14:26:15,624 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:26:15,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:26:15,625 INFO L158 Benchmark]: Toolchain (without parser) took 2280.40ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 73.0MB in the end (delta: -29.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:26:15,625 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 86.0MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:26:15,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.35ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 72.5MB in the end (delta: -28.6MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-09 14:26:15,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 104.9MB. Free memory was 72.5MB in the beginning and 69.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 14:26:15,626 INFO L158 Benchmark]: Boogie Preprocessor took 52.09ms. Allocated memory is still 104.9MB. Free memory was 69.5MB in the beginning and 66.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:26:15,627 INFO L158 Benchmark]: RCFGBuilder took 290.64ms. Allocated memory is still 104.9MB. Free memory was 66.2MB in the beginning and 50.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 14:26:15,627 INFO L158 Benchmark]: TraceAbstraction took 1071.49ms. Allocated memory is still 104.9MB. Free memory was 50.0MB in the beginning and 73.0MB in the end (delta: -23.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 14:26:15,627 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 104.9MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:26:15,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 86.0MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 812.35ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 72.5MB in the end (delta: -28.6MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 104.9MB. Free memory was 72.5MB in the beginning and 69.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.09ms. Allocated memory is still 104.9MB. Free memory was 69.5MB in the beginning and 66.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 290.64ms. Allocated memory is still 104.9MB. Free memory was 66.2MB in the beginning and 50.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1071.49ms. Allocated memory is still 104.9MB. Free memory was 50.0MB in the beginning and 73.0MB in the end (delta: -23.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 104.9MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1564]: 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 1587. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1587] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1587] 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] [L1588] CALL CWE191_Integer_Underflow__int_rand_multiply_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1562] COND TRUE data < 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] data * 2 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: 1564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1574]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 56 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 0 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 14:26:15,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample