./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_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 0e2dcecc71c03e0b00497f19d9bf0a634e59660bb1b10ca43933af0651417712 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:25:17,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:25:18,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 22:25:18,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:25:18,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:25:18,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:25:18,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:25:18,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:25:18,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:25:18,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:25:18,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:25:18,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:25:18,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:25:18,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:25:18,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:25:18,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:25:18,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:25:18,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 22:25:18,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:25:18,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:25:18,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:25:18,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:25:18,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:25:18,070 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:25:18,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:25:18,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:25:18,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:25:18,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:25:18,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:25:18,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:25:18,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:25:18,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:18,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:25:18,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:25:18,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:25:18,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 22:25:18,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 22:25:18,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:25:18,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:25:18,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:25:18,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:25:18,075 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 -> 0e2dcecc71c03e0b00497f19d9bf0a634e59660bb1b10ca43933af0651417712 [2024-10-14 22:25:18,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:25:18,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:25:18,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:25:18,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:25:18,323 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:25:18,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:19,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:25:20,117 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:25:20,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:20,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c6b36e5/2d6e9992fbe34bb4a4c77561336b587d/FLAG8ec367860 [2024-10-14 22:25:20,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c6b36e5/2d6e9992fbe34bb4a4c77561336b587d [2024-10-14 22:25:20,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:25:20,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:25:20,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:20,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:25:20,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:25:20,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c1e888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:20, skipping insertion in model container [2024-10-14 22:25:20,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:20" (1/1) ... [2024-10-14 22:25:20,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:25:20,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:20,848 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:25:20,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:21,096 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:25:21,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21 WrapperNode [2024-10-14 22:25:21,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:21,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:21,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:25:21,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:25:21,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,193 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-10-14 22:25:21,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:21,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:25:21,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:25:21,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:25:21,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,226 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:25:21,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:25:21,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:25:21,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:25:21,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:25:21,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (1/1) ... [2024-10-14 22:25:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:25:21,271 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-10-14 22:25:21,276 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-10-14 22:25:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:25:21,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:25:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:25:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:25:21,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:25:21,404 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:25:21,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:25:21,469 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 22:25:21,469 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:25:21,488 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:25:21,489 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:25:21,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21 BoogieIcfgContainer [2024-10-14 22:25:21,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:25:21,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:25:21,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:25:21,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:25:21,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:25:20" (1/3) ... [2024-10-14 22:25:21,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ead586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:21, skipping insertion in model container [2024-10-14 22:25:21,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:21" (2/3) ... [2024-10-14 22:25:21,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ead586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:21, skipping insertion in model container [2024-10-14 22:25:21,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21" (3/3) ... [2024-10-14 22:25:21,495 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:21,508 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:25:21,508 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:25:21,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:25:21,570 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;@31154b69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:25:21,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:25:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 22:25:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 22:25:21,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1013506268, now seen corresponding path program 1 times [2024-10-14 22:25:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550011023] [2024-10-14 22:25:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:21,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550011023] [2024-10-14 22:25:21,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550011023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 22:25:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333414482] [2024-10-14 22:25:21,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:21,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,871 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:21,897 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-14 22:25:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:21,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 22:25:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:21,904 INFO L225 Difference]: With dead ends: 30 [2024-10-14 22:25:21,904 INFO L226 Difference]: Without dead ends: 13 [2024-10-14 22:25:21,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:21,910 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:21,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-14 22:25:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-14 22:25:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-10-14 22:25:21,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2024-10-14 22:25:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-10-14 22:25:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-10-14 22:25:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 22:25:21,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:21,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:21,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 22:25:21,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:21,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1013508190, now seen corresponding path program 1 times [2024-10-14 22:25:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083539273] [2024-10-14 22:25:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:25:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:25:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083539273] [2024-10-14 22:25:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083539273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:22,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:25:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886467374] [2024-10-14 22:25:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:25:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:22,011 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:22,018 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 22:25:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 22:25:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:22,019 INFO L225 Difference]: With dead ends: 13 [2024-10-14 22:25:22,020 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 22:25:22,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:22,021 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:22,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 22:25:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-14 22:25:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-10-14 22:25:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-14 22:25:22,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2024-10-14 22:25:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:22,024 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-14 22:25:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-14 22:25:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 22:25:22,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:22,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:22,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 22:25:22,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1353982763, now seen corresponding path program 1 times [2024-10-14 22:25:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:25:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886195352] [2024-10-14 22:25:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:25:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:25:22,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:25:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:25:22,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 22:25:22,082 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:25:22,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:25:22,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:25:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 22:25:22,087 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 22:25:22,108 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:25:22,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:25:22 BoogieIcfgContainer [2024-10-14 22:25:22,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:25:22,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:25:22,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:25:22,114 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:25:22,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:21" (3/4) ... [2024-10-14 22:25:22,116 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:25:22,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:25:22,117 INFO L158 Benchmark]: Toolchain (without parser) took 1955.16ms. Allocated memory is still 213.9MB. Free memory was 143.3MB in the beginning and 96.8MB in the end (delta: 46.6MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,118 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:22,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 932.12ms. Allocated memory is still 213.9MB. Free memory was 143.0MB in the beginning and 154.5MB in the end (delta: -11.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.39ms. Allocated memory is still 213.9MB. Free memory was 154.5MB in the beginning and 152.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,119 INFO L158 Benchmark]: Boogie Preprocessor took 44.79ms. Allocated memory is still 213.9MB. Free memory was 151.3MB in the beginning and 150.3MB in the end (delta: 965.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:22,119 INFO L158 Benchmark]: RCFGBuilder took 247.77ms. Allocated memory is still 213.9MB. Free memory was 150.2MB in the beginning and 136.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,120 INFO L158 Benchmark]: TraceAbstraction took 622.91ms. Allocated memory is still 213.9MB. Free memory was 135.7MB in the beginning and 96.8MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 22:25:22,120 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 213.9MB. Free memory was 96.8MB in the beginning and 96.8MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:22,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 932.12ms. Allocated memory is still 213.9MB. Free memory was 143.0MB in the beginning and 154.5MB in the end (delta: -11.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.39ms. Allocated memory is still 213.9MB. Free memory was 154.5MB in the beginning and 152.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.79ms. Allocated memory is still 213.9MB. Free memory was 151.3MB in the beginning and 150.3MB in the end (delta: 965.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.77ms. Allocated memory is still 213.9MB. Free memory was 150.2MB in the beginning and 136.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 622.91ms. Allocated memory is still 213.9MB. Free memory was 135.7MB in the beginning and 96.8MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 213.9MB. Free memory was 96.8MB in the beginning and 96.8MB in the end (delta: 2.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: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. 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); [L1568] 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) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_max_preinc_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1554] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE \read(GLOBAL_CONST_TRUE) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1559] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 22 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 22:25:22,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_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 0e2dcecc71c03e0b00497f19d9bf0a634e59660bb1b10ca43933af0651417712 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:25:24,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:25:24,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-14 22:25:24,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:25:24,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:25:24,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-14 22:25:24,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:25:24,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:25:24,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:25:24,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:25:24,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:25:24,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:25:24,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:25:24,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:25:24,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:25:24,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:25:24,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:25:24,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:25:24,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:25:24,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:25:24,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:25:24,505 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:25:24,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:25:24,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:24,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 22:25:24,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:25:24,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:25:24,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:25:24,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:25:24,513 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 22:25:24,513 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 -> 0e2dcecc71c03e0b00497f19d9bf0a634e59660bb1b10ca43933af0651417712 [2024-10-14 22:25:24,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:25:24,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:25:24,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:25:24,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:25:24,985 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:25:24,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:26,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:25:26,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:25:26,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:26,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947bdb61d/295f51d3a795499a8923e6303a6a74d1/FLAGbfcc52f1c [2024-10-14 22:25:26,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947bdb61d/295f51d3a795499a8923e6303a6a74d1 [2024-10-14 22:25:26,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:25:26,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:25:26,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:26,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:25:26,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:25:26,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:26" (1/1) ... [2024-10-14 22:25:26,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fccd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:26, skipping insertion in model container [2024-10-14 22:25:26,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:25:26" (1/1) ... [2024-10-14 22:25:26,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:25:27,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:27,506 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:25:27,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:25:27,693 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:25:27,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27 WrapperNode [2024-10-14 22:25:27,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:25:27,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:27,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:25:27,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:25:27,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,748 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-10-14 22:25:27,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:25:27,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:25:27,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:25:27,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:25:27,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,774 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:25:27,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:25:27,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:25:27,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:25:27,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:25:27,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (1/1) ... [2024-10-14 22:25:27,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:25:27,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:25:27,841 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-10-14 22:25:27,846 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-10-14 22:25:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:25:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:25:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:25:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:25:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:25:28,005 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:25:28,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:25:28,093 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 22:25:28,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:25:28,115 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:25:28,115 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:25:28,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:28 BoogieIcfgContainer [2024-10-14 22:25:28,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:25:28,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:25:28,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:25:28,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:25:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:25:26" (1/3) ... [2024-10-14 22:25:28,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6980fafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:28, skipping insertion in model container [2024-10-14 22:25:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:25:27" (2/3) ... [2024-10-14 22:25:28,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6980fafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:25:28, skipping insertion in model container [2024-10-14 22:25:28,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:28" (3/3) ... [2024-10-14 22:25:28,122 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_preinc_09_bad.i [2024-10-14 22:25:28,134 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:25:28,134 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:25:28,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:25:28,178 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;@6982d246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:25:28,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:25:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 22:25:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 22:25:28,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:28,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:28,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:28,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1013506268, now seen corresponding path program 1 times [2024-10-14 22:25:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:25:28,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799868986] [2024-10-14 22:25:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:25:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:25:28,220 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-10-14 22:25:28,223 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-10-14 22:25:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:28,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 22:25:28,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:25:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:28,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:25:28,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:25:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799868986] [2024-10-14 22:25:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799868986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 22:25:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080987773] [2024-10-14 22:25:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 22:25:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:25:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 22:25:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:25:28,328 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:28,351 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-14 22:25:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 22:25:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 22:25:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:28,365 INFO L225 Difference]: With dead ends: 17 [2024-10-14 22:25:28,365 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 22:25:28,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:25:28,373 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:28,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 22:25:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-14 22:25:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-14 22:25:28,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-10-14 22:25:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:28,435 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-14 22:25:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-14 22:25:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 22:25:28,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:28,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:28,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 22:25:28,636 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-10-14 22:25:28,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1353923181, now seen corresponding path program 1 times [2024-10-14 22:25:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:25:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989684261] [2024-10-14 22:25:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:25:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:25:28,641 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-10-14 22:25:28,646 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-10-14 22:25:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:25:28,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 22:25:28,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:25:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:25:28,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:25:28,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:25:28,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989684261] [2024-10-14 22:25:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989684261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:25:28,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:25:28,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:25:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585418243] [2024-10-14 22:25:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:25:28,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:25:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:25:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:25:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:28,717 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:25:28,724 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-14 22:25:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:25:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 22:25:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:25:28,725 INFO L225 Difference]: With dead ends: 16 [2024-10-14 22:25:28,725 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 22:25:28,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:25:28,726 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:25:28,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:25:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 22:25:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-14 22:25:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-10-14 22:25:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-14 22:25:28,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2024-10-14 22:25:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:25:28,729 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-14 22:25:28,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 22:25:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-14 22:25:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 22:25:28,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:25:28,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:25:28,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 22:25:28,930 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-10-14 22:25:28,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:25:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:25:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1353982763, now seen corresponding path program 1 times [2024-10-14 22:25:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:25:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427079612] [2024-10-14 22:25:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:25:28,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 22:25:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:25:28,935 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-10-14 22:25:28,936 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-10-14 22:25:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:25:28,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:25:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:25:29,004 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 22:25:29,004 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:25:29,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:25:29,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:25:29,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 22:25:29,210 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-10-14 22:25:29,213 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 22:25:29,227 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:25:29,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:25:29 BoogieIcfgContainer [2024-10-14 22:25:29,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:25:29,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:25:29,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:25:29,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:25:29,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:25:28" (3/4) ... [2024-10-14 22:25:29,232 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:25:29,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:25:29,234 INFO L158 Benchmark]: Toolchain (without parser) took 2464.45ms. Allocated memory was 75.5MB in the beginning and 127.9MB in the end (delta: 52.4MB). Free memory was 54.5MB in the beginning and 81.5MB in the end (delta: -27.1MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-14 22:25:29,234 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:29,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 923.89ms. Allocated memory was 75.5MB in the beginning and 127.9MB in the end (delta: 52.4MB). Free memory was 54.2MB in the beginning and 98.2MB in the end (delta: -43.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-10-14 22:25:29,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.81ms. Allocated memory is still 127.9MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:25:29,235 INFO L158 Benchmark]: Boogie Preprocessor took 47.98ms. Allocated memory is still 127.9MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:25:29,235 INFO L158 Benchmark]: RCFGBuilder took 313.14ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 22:25:29,236 INFO L158 Benchmark]: TraceAbstraction took 1113.05ms. Allocated memory is still 127.9MB. Free memory was 77.2MB in the beginning and 81.5MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:29,236 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 127.9MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:25:29,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 923.89ms. Allocated memory was 75.5MB in the beginning and 127.9MB in the end (delta: 52.4MB). Free memory was 54.2MB in the beginning and 98.2MB in the end (delta: -43.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.81ms. Allocated memory is still 127.9MB. Free memory was 97.5MB in the beginning and 94.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.98ms. Allocated memory is still 127.9MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 313.14ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1113.05ms. Allocated memory is still 127.9MB. Free memory was 77.2MB in the beginning and 81.5MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 127.9MB. Free memory is still 81.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: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. 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); [L1568] 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) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_max_preinc_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1554] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE \read(GLOBAL_CONST_TRUE) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1559] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, 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, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 33 SizeOfPredicates, 0 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 22:25:29,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample