./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 23:54:58,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 23:54:58,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-22 23:54:58,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 23:54:58,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 23:54:58,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 23:54:58,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 23:54:58,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 23:54:58,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 23:54:58,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 23:54:58,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 23:54:58,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 23:54:58,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 23:54:58,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 23:54:58,337 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 23:54:58,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 23:54:58,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 23:54:58,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 23:54:58,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 23:54:58,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 23:54:58,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 23:54:58,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 23:54:58,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 23:54:58,341 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 23:54:58,341 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 23:54:58,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 23:54:58,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 23:54:58,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 23:54:58,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 23:54:58,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 23:54:58,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 23:54:58,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:54:58,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 23:54:58,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 23:54:58,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 23:54:58,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 23:54:58,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 23:54:58,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 23:54:58,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 23:54:58,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 23:54:58,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 23:54:58,346 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 -> ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 [2024-11-22 23:54:58,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 23:54:58,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 23:54:58,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 23:54:58,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 23:54:58,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 23:54:58,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:54:59,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 23:55:00,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 23:55:00,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:55:00,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca14fe4d2/f91bdc180e45498a9d91622fd74dff17/FLAG0d6c459f7 [2024-11-22 23:55:00,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca14fe4d2/f91bdc180e45498a9d91622fd74dff17 [2024-11-22 23:55:00,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 23:55:00,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 23:55:00,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 23:55:00,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 23:55:00,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 23:55:00,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:00,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5bb510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00, skipping insertion in model container [2024-11-22 23:55:00,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:00,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 23:55:00,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:55:00,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 23:55:00,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:55:00,998 INFO L204 MainTranslator]: Completed translation [2024-11-22 23:55:00,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00 WrapperNode [2024-11-22 23:55:00,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 23:55:01,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 23:55:01,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 23:55:01,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 23:55:01,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,061 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-22 23:55:01,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 23:55:01,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 23:55:01,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 23:55:01,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 23:55:01,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,093 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-22 23:55:01,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 23:55:01,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 23:55:01,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 23:55:01,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 23:55:01,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (1/1) ... [2024-11-22 23:55:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:55:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:55:01,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 23:55:01,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 23:55:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-22 23:55:01,176 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-22 23:55:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-22 23:55:01,176 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-22 23:55:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-22 23:55:01,176 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-22 23:55:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 23:55:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 23:55:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 23:55:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 23:55:01,291 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 23:55:01,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 23:55:01,419 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 23:55:01,423 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 23:55:01,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 23:55:01,432 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 23:55:01,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:01 BoogieIcfgContainer [2024-11-22 23:55:01,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 23:55:01,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 23:55:01,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 23:55:01,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 23:55:01,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:55:00" (1/3) ... [2024-11-22 23:55:01,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278f193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:01, skipping insertion in model container [2024-11-22 23:55:01,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:00" (2/3) ... [2024-11-22 23:55:01,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278f193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:01, skipping insertion in model container [2024-11-22 23:55:01,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:01" (3/3) ... [2024-11-22 23:55:01,441 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:55:01,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 23:55:01,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-22 23:55:01,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 23:55:01,510 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;@f0e2a76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 23:55:01,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 23:55:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 23:55:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 23:55:01,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:01,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:01,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -786218938, now seen corresponding path program 1 times [2024-11-22 23:55:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:55:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257605884] [2024-11-22 23:55:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:55:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:55:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257605884] [2024-11-22 23:55:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257605884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:55:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846358947] [2024-11-22 23:55:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:55:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:55:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:55:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:01,994 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:02,057 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-11-22 23:55:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:55:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-22 23:55:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:02,065 INFO L225 Difference]: With dead ends: 65 [2024-11-22 23:55:02,066 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 23:55:02,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:02,073 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:02,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 23:55:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-22 23:55:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 23:55:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-22 23:55:02,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 21 [2024-11-22 23:55:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-22 23:55:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-22 23:55:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 23:55:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:02,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 23:55:02,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:02,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1397024746, now seen corresponding path program 1 times [2024-11-22 23:55:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:55:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439233731] [2024-11-22 23:55:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:55:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:02,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:55:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439233731] [2024-11-22 23:55:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439233731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:02,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:02,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:55:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050524551] [2024-11-22 23:55:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:02,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:55:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:55:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:55:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:02,252 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:02,273 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-22 23:55:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:55:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-22 23:55:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:02,275 INFO L225 Difference]: With dead ends: 38 [2024-11-22 23:55:02,275 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 23:55:02,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:02,276 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:02,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 23:55:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 23:55:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 23:55:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-22 23:55:02,283 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2024-11-22 23:55:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:02,284 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-22 23:55:02,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-22 23:55:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 23:55:02,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:02,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 23:55:02,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -369234517, now seen corresponding path program 1 times [2024-11-22 23:55:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:55:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929069961] [2024-11-22 23:55:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:55:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:55:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929069961] [2024-11-22 23:55:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929069961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:02,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:55:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135576946] [2024-11-22 23:55:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:02,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:55:02,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:55:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:55:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:02,388 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:02,424 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-22 23:55:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:55:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-22 23:55:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:02,426 INFO L225 Difference]: With dead ends: 30 [2024-11-22 23:55:02,426 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 23:55:02,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:02,427 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:02,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 23:55:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-22 23:55:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 23:55:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-22 23:55:02,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2024-11-22 23:55:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-22 23:55:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-22 23:55:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 23:55:02,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:02,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 23:55:02,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1438631933, now seen corresponding path program 1 times [2024-11-22 23:55:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:55:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028043697] [2024-11-22 23:55:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:55:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:55:02,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 23:55:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:55:02,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 23:55:02,507 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 23:55:02,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-22 23:55:02,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-22 23:55:02,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-22 23:55:02,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-22 23:55:02,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 23:55:02,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 23:55:02,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 23:55:02,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:55:02 BoogieIcfgContainer [2024-11-22 23:55:02,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 23:55:02,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 23:55:02,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 23:55:02,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 23:55:02,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:01" (3/4) ... [2024-11-22 23:55:02,544 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 23:55:02,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 23:55:02,546 INFO L158 Benchmark]: Toolchain (without parser) took 2370.01ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 92.9MB in the beginning and 138.6MB in the end (delta: -45.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-22 23:55:02,547 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:02,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.69ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 82.6MB in the end (delta: 10.0MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-22 23:55:02,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.62ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 79.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 23:55:02,549 INFO L158 Benchmark]: Boogie Preprocessor took 41.49ms. Allocated memory is still 167.8MB. Free memory was 79.3MB in the beginning and 77.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 23:55:02,549 INFO L158 Benchmark]: RCFGBuilder took 327.89ms. Allocated memory is still 167.8MB. Free memory was 77.3MB in the beginning and 61.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 23:55:02,549 INFO L158 Benchmark]: TraceAbstraction took 1106.27ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 60.5MB in the beginning and 138.6MB in the end (delta: -78.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:02,549 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 237.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:02,551 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.18ms. Allocated memory is still 167.8MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.69ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 82.6MB in the end (delta: 10.0MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.62ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 79.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.49ms. Allocated memory is still 167.8MB. Free memory was 79.3MB in the beginning and 77.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.89ms. Allocated memory is still 167.8MB. Free memory was 77.3MB in the beginning and 61.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1106.27ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 60.5MB in the beginning and 138.6MB in the end (delta: -78.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 237.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] 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] [L1596] CALL CWE190_Integer_Overflow__int_fgets_postinc_12_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] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() 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] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 310 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 115 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 23:55:02,570 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 ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 23:55:04,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 23:55:04,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-22 23:55:04,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 23:55:04,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 23:55:04,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-22 23:55:04,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 23:55:04,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 23:55:04,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 23:55:04,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 23:55:04,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 23:55:04,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 23:55:04,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 23:55:04,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 23:55:04,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 23:55:04,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 23:55:04,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 23:55:04,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 23:55:04,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 23:55:04,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 23:55:04,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 23:55:04,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 23:55:04,706 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 23:55:04,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 23:55:04,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 23:55:04,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 23:55:04,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 23:55:04,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 23:55:04,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:55:04,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 23:55:04,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 23:55:04,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 23:55:04,710 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 23:55:04,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 23:55:04,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 23:55:04,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 23:55:04,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 23:55:04,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 23:55:04,712 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 -> ae52c5d582497291c525bb7e5d6f537c4a681411b48fa6449cbc12b3d30c90d5 [2024-11-22 23:55:04,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 23:55:04,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 23:55:04,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 23:55:04,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 23:55:04,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 23:55:04,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:55:06,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 23:55:06,694 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 23:55:06,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:55:06,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392ea9510/ba21a7594f9b4f77a5307498581a6d75/FLAGad183c367 [2024-11-22 23:55:06,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392ea9510/ba21a7594f9b4f77a5307498581a6d75 [2024-11-22 23:55:06,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 23:55:06,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 23:55:06,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 23:55:06,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 23:55:07,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 23:55:07,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:06" (1/1) ... [2024-11-22 23:55:07,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c7d6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07, skipping insertion in model container [2024-11-22 23:55:07,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:06" (1/1) ... [2024-11-22 23:55:07,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 23:55:07,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:55:07,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 23:55:07,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:55:07,836 INFO L204 MainTranslator]: Completed translation [2024-11-22 23:55:07,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07 WrapperNode [2024-11-22 23:55:07,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 23:55:07,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 23:55:07,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 23:55:07,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 23:55:07,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,896 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-11-22 23:55:07,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 23:55:07,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 23:55:07,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 23:55:07,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 23:55:07,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,923 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-22 23:55:07,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 23:55:07,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 23:55:07,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 23:55:07,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 23:55:07,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (1/1) ... [2024-11-22 23:55:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:55:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:55:07,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 23:55:07,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-22 23:55:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-22 23:55:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-22 23:55:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 23:55:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 23:55:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 23:55:08,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 23:55:08,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 23:55:08,360 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-22 23:55:08,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 23:55:08,372 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 23:55:08,372 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 23:55:08,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:08 BoogieIcfgContainer [2024-11-22 23:55:08,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 23:55:08,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 23:55:08,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 23:55:08,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 23:55:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:55:06" (1/3) ... [2024-11-22 23:55:08,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691a71c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:08, skipping insertion in model container [2024-11-22 23:55:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:07" (2/3) ... [2024-11-22 23:55:08,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691a71c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:08, skipping insertion in model container [2024-11-22 23:55:08,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:08" (3/3) ... [2024-11-22 23:55:08,381 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2024-11-22 23:55:08,394 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 23:55:08,394 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-22 23:55:08,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 23:55:08,483 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;@7294de61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 23:55:08,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 23:55:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 23:55:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 23:55:08,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:08,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:08,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1142699916, now seen corresponding path program 1 times [2024-11-22 23:55:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 23:55:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202983250] [2024-11-22 23:55:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:08,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 23:55:08,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 23:55:08,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 23:55:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:08,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 23:55:08,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:55:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:08,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:55:08,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 23:55:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202983250] [2024-11-22 23:55:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202983250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 23:55:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006032257] [2024-11-22 23:55:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:08,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 23:55:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 23:55:08,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 23:55:08,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 23:55:08,666 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 23:55:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:08,681 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-22 23:55:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 23:55:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-22 23:55:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:08,688 INFO L225 Difference]: With dead ends: 43 [2024-11-22 23:55:08,688 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 23:55:08,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 23:55:08,695 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:08,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 23:55:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 23:55:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 23:55:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-22 23:55:08,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-22 23:55:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:08,728 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-22 23:55:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 23:55:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-22 23:55:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 23:55:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:08,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:08,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 23:55:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:08,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1063959098, now seen corresponding path program 1 times [2024-11-22 23:55:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 23:55:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838978002] [2024-11-22 23:55:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 23:55:08,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 23:55:08,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 (3)] Waiting until timeout for monitored process [2024-11-22 23:55:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:09,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:55:09,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:55:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:09,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:55:09,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 23:55:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838978002] [2024-11-22 23:55:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838978002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:55:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085032926] [2024-11-22 23:55:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:55:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 23:55:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:55:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:09,060 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:09,088 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-22 23:55:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:55:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-22 23:55:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:09,089 INFO L225 Difference]: With dead ends: 32 [2024-11-22 23:55:09,089 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 23:55:09,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:09,090 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:09,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 23:55:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-22 23:55:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 23:55:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-22 23:55:09,099 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2024-11-22 23:55:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:09,099 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-22 23:55:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-22 23:55:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 23:55:09,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:09,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:09,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 23:55:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:09,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:09,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1376758993, now seen corresponding path program 1 times [2024-11-22 23:55:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 23:55:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189423970] [2024-11-22 23:55:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 23:55:09,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 23:55:09,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 23:55:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:55:09,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:55:09,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:55:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:55:09,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:55:09,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 23:55:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189423970] [2024-11-22 23:55:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189423970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:55:09,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:55:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 23:55:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200694008] [2024-11-22 23:55:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:55:09,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:55:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 23:55:09,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:55:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:09,411 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:55:09,431 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-22 23:55:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:55:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-22 23:55:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:55:09,446 INFO L225 Difference]: With dead ends: 32 [2024-11-22 23:55:09,446 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 23:55:09,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:55:09,448 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:55:09,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:55:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 23:55:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 23:55:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 23:55:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-22 23:55:09,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2024-11-22 23:55:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:55:09,454 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-22 23:55:09,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:55:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-22 23:55:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 23:55:09,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:55:09,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:55:09,459 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-11-22 23:55:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:09,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-22 23:55:09,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:55:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1438631169, now seen corresponding path program 1 times [2024-11-22 23:55:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 23:55:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823387584] [2024-11-22 23:55:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:55:09,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 23:55:09,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 23:55:09,666 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 (5)] Waiting until timeout for monitored process [2024-11-22 23:55:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:55:09,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 23:55:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:55:09,769 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 23:55:09,769 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 23:55:09,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-22 23:55:09,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-22 23:55:09,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-22 23:55:09,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-22 23:55:09,785 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 (5)] Forceful destruction successful, exit code 0 [2024-11-22 23:55:09,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 23:55:09,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 23:55:09,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 23:55:09,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:55:09 BoogieIcfgContainer [2024-11-22 23:55:09,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 23:55:09,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 23:55:09,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 23:55:09,999 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 23:55:09,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:08" (3/4) ... [2024-11-22 23:55:10,001 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 23:55:10,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 23:55:10,003 INFO L158 Benchmark]: Toolchain (without parser) took 3006.50ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 72.7MB in the beginning and 114.1MB in the end (delta: -41.4MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-22 23:55:10,003 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:10,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.18ms. Allocated memory is still 109.1MB. Free memory was 72.4MB in the beginning and 68.2MB in the end (delta: 4.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-22 23:55:10,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 65.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 23:55:10,004 INFO L158 Benchmark]: Boogie Preprocessor took 38.93ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 62.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 23:55:10,005 INFO L158 Benchmark]: RCFGBuilder took 437.18ms. Allocated memory is still 109.1MB. Free memory was 62.5MB in the beginning and 45.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 23:55:10,005 INFO L158 Benchmark]: TraceAbstraction took 1622.76ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 45.2MB in the beginning and 114.1MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:10,005 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 159.4MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:55:10,007 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 58.7MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.18ms. Allocated memory is still 109.1MB. Free memory was 72.4MB in the beginning and 68.2MB in the end (delta: 4.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 65.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.93ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 62.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.18ms. Allocated memory is still 109.1MB. Free memory was 62.5MB in the beginning and 45.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1622.76ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 45.2MB in the beginning and 114.1MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 159.4MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1595, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1595] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1595] 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] [L1596] CALL CWE190_Integer_Overflow__int_fgets_postinc_12_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] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() 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] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1582]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 109 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 23:55:10,025 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