./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_postdec_17_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 aa8ec24a529b9708a4114d222c12978bf5bdc2ac2c4c1795c91ce64eb68dd2d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:21:06,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:21:06,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 13:21:06,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:21:06,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:21:06,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:21:06,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:21:06,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:21:06,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:21:06,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:21:06,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:21:06,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:21:06,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:21:06,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:21:06,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:21:06,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:21:06,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:21:06,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:21:06,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:21:06,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:21:06,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:21:06,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:21:06,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:21:06,482 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:21:06,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:21:06,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:21:06,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:21:06,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:21:06,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:21:06,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:21:06,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:21:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:06,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:21:06,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:21:06,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:21:06,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:21:06,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:21:06,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:21:06,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:21:06,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:21:06,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:21:06,486 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 -> aa8ec24a529b9708a4114d222c12978bf5bdc2ac2c4c1795c91ce64eb68dd2d4 [2024-11-19 13:21:06,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:21:06,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:21:06,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:21:06,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:21:06,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:21:06,711 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_postdec_17_bad.i [2024-11-19 13:21:07,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:21:08,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:21:08,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_bad.i [2024-11-19 13:21:08,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4996f10e0/a68edd50cde34d78bc237ef36db4baec/FLAG8652edfbf [2024-11-19 13:21:08,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4996f10e0/a68edd50cde34d78bc237ef36db4baec [2024-11-19 13:21:08,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:21:08,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:21:08,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:08,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:21:08,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:21:08,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:08,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bac3fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08, skipping insertion in model container [2024-11-19 13:21:08,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:08,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:21:08,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:08,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:21:08,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:08,944 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:21:08,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08 WrapperNode [2024-11-19 13:21:08,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:08,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:08,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:21:08,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:21:08,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:08,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,000 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-19 13:21:09,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:09,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:21:09,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:21:09,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:21:09,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,019 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 13:21:09,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:21:09,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:21:09,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:21:09,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:21:09,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (1/1) ... [2024-11-19 13:21:09,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:21:09,055 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-19 13:21:09,059 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-19 13:21:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 13:21:09,119 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 13:21:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:21:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:21:09,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:21:09,274 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:21:09,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:21:09,448 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-19 13:21:09,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:21:09,456 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:21:09,456 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 13:21:09,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:09 BoogieIcfgContainer [2024-11-19 13:21:09,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:21:09,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:21:09,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:21:09,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:21:09,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:08" (1/3) ... [2024-11-19 13:21:09,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e487b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:09, skipping insertion in model container [2024-11-19 13:21:09,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:08" (2/3) ... [2024-11-19 13:21:09,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e487b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:09, skipping insertion in model container [2024-11-19 13:21:09,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:09" (3/3) ... [2024-11-19 13:21:09,465 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_17_bad.i [2024-11-19 13:21:09,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:21:09,476 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 13:21:09,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:21:09,519 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;@655a5d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:21:09,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 13:21:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 50 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 13:21:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 13:21:09,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:09,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:09,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 979903928, now seen corresponding path program 1 times [2024-11-19 13:21:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:09,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675970004] [2024-11-19 13:21:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:21:09,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675970004] [2024-11-19 13:21:09,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675970004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:09,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483705086] [2024-11-19 13:21:09,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:09,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:21:09,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:21:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:21:09,736 INFO L87 Difference]: Start difference. First operand has 54 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 50 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:09,766 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2024-11-19 13:21:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:21:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 13:21:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:09,774 INFO L225 Difference]: With dead ends: 100 [2024-11-19 13:21:09,774 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 13:21:09,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 13:21:09,780 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:09,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 13:21:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2024-11-19 13:21:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 46 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-19 13:21:09,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 12 [2024-11-19 13:21:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-19 13:21:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-19 13:21:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 13:21:09,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:09,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:21:09,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1477614791, now seen corresponding path program 1 times [2024-11-19 13:21:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353199667] [2024-11-19 13:21:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:21:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353199667] [2024-11-19 13:21:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353199667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763092111] [2024-11-19 13:21:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:09,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:09,930 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:09,961 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-11-19 13:21:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 13:21:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:09,963 INFO L225 Difference]: With dead ends: 76 [2024-11-19 13:21:09,963 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 13:21:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:09,964 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:09,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 13:21:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 13:21:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 71 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-19 13:21:09,973 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 17 [2024-11-19 13:21:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:09,973 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-19 13:21:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-19 13:21:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 13:21:09,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:09,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:09,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 13:21:09,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1917426333, now seen corresponding path program 1 times [2024-11-19 13:21:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294280045] [2024-11-19 13:21:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:21:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:21:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294280045] [2024-11-19 13:21:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294280045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:21:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573369571] [2024-11-19 13:21:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:21:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:21:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:21:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:21:10,285 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:10,389 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2024-11-19 13:21:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 13:21:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-19 13:21:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:10,392 INFO L225 Difference]: With dead ends: 116 [2024-11-19 13:21:10,392 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 13:21:10,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:21:10,393 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 45 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:10,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 297 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:21:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 13:21:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-11-19 13:21:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4625) internal successors, (117), 85 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2024-11-19 13:21:10,406 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 22 [2024-11-19 13:21:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2024-11-19 13:21:10,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2024-11-19 13:21:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 13:21:10,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:10,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:21:10,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1562176323, now seen corresponding path program 1 times [2024-11-19 13:21:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:21:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535483498] [2024-11-19 13:21:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:21:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:10,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:21:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:10,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 13:21:10,464 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:21:10,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 13:21:10,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 13:21:10,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 13:21:10,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 13:21:10,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 13:21:10,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 13:21:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 13:21:10,469 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 13:21:10,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:21:10,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:21:10 BoogieIcfgContainer [2024-11-19 13:21:10,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:21:10,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:21:10,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:21:10,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:21:10,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:09" (3/4) ... [2024-11-19 13:21:10,500 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:21:10,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:21:10,502 INFO L158 Benchmark]: Toolchain (without parser) took 2322.42ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 99.1MB in the beginning and 110.5MB in the end (delta: -11.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,502 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:10,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.36ms. Allocated memory is still 148.9MB. Free memory was 99.1MB in the beginning and 107.6MB in the end (delta: -8.5MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.64ms. Allocated memory is still 148.9MB. Free memory was 107.6MB in the beginning and 104.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,503 INFO L158 Benchmark]: Boogie Preprocessor took 28.07ms. Allocated memory is still 148.9MB. Free memory was 104.9MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,503 INFO L158 Benchmark]: RCFGBuilder took 426.14ms. Allocated memory is still 148.9MB. Free memory was 102.0MB in the beginning and 102.3MB in the end (delta: -266.5kB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,503 INFO L158 Benchmark]: TraceAbstraction took 1039.01ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 101.6MB in the beginning and 110.5MB in the end (delta: -8.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-19 13:21:10,503 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 188.7MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:10,506 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.13ms. Allocated memory is still 100.7MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.36ms. Allocated memory is still 148.9MB. Free memory was 99.1MB in the beginning and 107.6MB in the end (delta: -8.5MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.64ms. Allocated memory is still 148.9MB. Free memory was 107.6MB in the beginning and 104.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.07ms. Allocated memory is still 148.9MB. Free memory was 104.9MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.14ms. Allocated memory is still 148.9MB. Free memory was 102.0MB in the beginning and 102.3MB in the end (delta: -266.5kB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1039.01ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 101.6MB in the beginning and 110.5MB in the end (delta: -8.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 188.7MB. Free memory is still 110.5MB. 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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1557] j = 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, j=0] [L1557] COND TRUE j < 1 [L1560] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 601 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 178 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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-19 13:21:10,528 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_postdec_17_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 aa8ec24a529b9708a4114d222c12978bf5bdc2ac2c4c1795c91ce64eb68dd2d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:21:12,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:21:12,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 13:21:12,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:21:12,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:21:12,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 13:21:12,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:21:12,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:21:12,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:21:12,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:21:12,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:21:12,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:21:12,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:21:12,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:21:12,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:21:12,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:21:12,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:21:12,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:21:12,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:21:12,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:21:12,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:21:12,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:21:12,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 13:21:12,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 13:21:12,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:21:12,417 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:21:12,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 13:21:12,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:21:12,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:21:12,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:21:12,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:21:12,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:21:12,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:21:12,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:21:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:12,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:21:12,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:21:12,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:21:12,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 13:21:12,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 13:21:12,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:21:12,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:21:12,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:21:12,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:21:12,423 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 -> aa8ec24a529b9708a4114d222c12978bf5bdc2ac2c4c1795c91ce64eb68dd2d4 [2024-11-19 13:21:12,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:21:12,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:21:12,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:21:12,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:21:12,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:21:12,691 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_postdec_17_bad.i [2024-11-19 13:21:13,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:21:14,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:21:14,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_17_bad.i [2024-11-19 13:21:14,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9803a2f/f51ad0f72b41456fad69c043d8538e6b/FLAG60a35ece3 [2024-11-19 13:21:14,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9803a2f/f51ad0f72b41456fad69c043d8538e6b [2024-11-19 13:21:14,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:21:14,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:21:14,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:14,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:21:14,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:21:14,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:14" (1/1) ... [2024-11-19 13:21:14,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d185299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:14, skipping insertion in model container [2024-11-19 13:21:14,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:14" (1/1) ... [2024-11-19 13:21:14,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:21:15,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:15,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:21:15,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:21:15,345 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:21:15,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15 WrapperNode [2024-11-19 13:21:15,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:21:15,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:15,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:21:15,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:21:15,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,393 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-11-19 13:21:15,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:21:15,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:21:15,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:21:15,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:21:15,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,427 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 13:21:15,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:21:15,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:21:15,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:21:15,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:21:15,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (1/1) ... [2024-11-19 13:21:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:21:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:21:15,476 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-19 13:21:15,479 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-19 13:21:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 13:21:15,511 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 13:21:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:21:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:21:15,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:21:15,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:21:15,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:21:15,766 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-19 13:21:15,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:21:15,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:21:15,778 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 13:21:15,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:15 BoogieIcfgContainer [2024-11-19 13:21:15,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:21:15,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:21:15,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:21:15,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:21:15,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:14" (1/3) ... [2024-11-19 13:21:15,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7235efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:15, skipping insertion in model container [2024-11-19 13:21:15,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:15" (2/3) ... [2024-11-19 13:21:15,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7235efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:15, skipping insertion in model container [2024-11-19 13:21:15,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:15" (3/3) ... [2024-11-19 13:21:15,786 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_17_bad.i [2024-11-19 13:21:15,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:21:15,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 13:21:15,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:21:15,858 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;@7e98276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:21:15,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 13:21:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.5) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 13:21:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 13:21:15,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:15,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:15,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 182604032, now seen corresponding path program 1 times [2024-11-19 13:21:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301604527] [2024-11-19 13:21:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:15,886 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-19 13:21:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:15,889 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-19 13:21:15,890 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-19 13:21:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:15,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:21:15,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:21:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:21:16,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:21:16,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:21:16,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301604527] [2024-11-19 13:21:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301604527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102515407] [2024-11-19 13:21:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:21:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:21:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:21:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:21:16,041 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.5) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:16,066 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-19 13:21:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:21:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 13:21:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:16,075 INFO L225 Difference]: With dead ends: 58 [2024-11-19 13:21:16,075 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 13:21:16,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:21:16,081 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:16,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 13:21:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-19 13:21:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-19 13:21:16,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2024-11-19 13:21:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-19 13:21:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-19 13:21:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 13:21:16,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:16,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:16,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 13:21:16,337 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-19 13:21:16,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -567406958, now seen corresponding path program 1 times [2024-11-19 13:21:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553967921] [2024-11-19 13:21:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:16,339 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-19 13:21:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:16,342 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-19 13:21:16,342 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-19 13:21:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:21:16,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:21:16,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:21:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:21:16,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:21:16,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:21:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553967921] [2024-11-19 13:21:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553967921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:21:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:21:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:21:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26402688] [2024-11-19 13:21:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:21:16,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:21:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:21:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:21:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:16,445 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:21:16,470 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 13:21:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:21:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 13:21:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:21:16,471 INFO L225 Difference]: With dead ends: 32 [2024-11-19 13:21:16,472 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 13:21:16,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:21:16,473 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:21:16,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:21:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 13:21:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 13:21:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-19 13:21:16,479 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 14 [2024-11-19 13:21:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:21:16,479 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 13:21:16,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:21:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-19 13:21:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 13:21:16,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:21:16,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:21:16,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 13:21:16,681 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-19 13:21:16,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:21:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:21:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -459846585, now seen corresponding path program 1 times [2024-11-19 13:21:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:21:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758371944] [2024-11-19 13:21:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:21:16,682 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-19 13:21:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:21:16,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:21:16,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 13:21:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:16,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:21:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:21:16,800 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 13:21:16,801 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:21:16,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 13:21:16,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 13:21:16,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 13:21:16,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 13:21:16,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 13:21:16,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 13:21:16,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 13:21:17,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:21:17,016 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 13:21:17,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:21:17,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:21:17 BoogieIcfgContainer [2024-11-19 13:21:17,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:21:17,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:21:17,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:21:17,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:21:17,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:15" (3/4) ... [2024-11-19 13:21:17,047 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:21:17,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:21:17,049 INFO L158 Benchmark]: Toolchain (without parser) took 2490.25ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 22.3MB in the beginning and 48.6MB in the end (delta: -26.2MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,049 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 54.5MB. Free memory is still 30.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:17,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.17ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 22.2MB in the beginning and 39.7MB in the end (delta: -17.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 36.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,050 INFO L158 Benchmark]: Boogie Preprocessor took 55.14ms. Allocated memory is still 69.2MB. Free memory was 36.3MB in the beginning and 33.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,051 INFO L158 Benchmark]: RCFGBuilder took 329.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 52.3MB in the end (delta: -18.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,052 INFO L158 Benchmark]: TraceAbstraction took 1263.87ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 49.1MB in the end (delta: 2.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-19 13:21:17,052 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 48.6MB in the end (delta: 548.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:21:17,054 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.79ms. Allocated memory is still 54.5MB. Free memory is still 30.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.17ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 22.2MB in the beginning and 39.7MB in the end (delta: -17.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 69.2MB. Free memory was 39.3MB in the beginning and 36.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.14ms. Allocated memory is still 69.2MB. Free memory was 36.3MB in the beginning and 33.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 52.3MB in the end (delta: -18.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1263.87ms. Allocated memory is still 83.9MB. Free memory was 51.4MB in the beginning and 49.1MB in the end (delta: 2.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 48.6MB in the end (delta: 548.7kB). 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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1557] j = 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, j=0] [L1557] COND TRUE j < 1 [L1560] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 57 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 13:21:17,079 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