./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-10 03:45:33,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 03:45:33,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 03:45:33,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 03:45:33,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 03:45:33,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 03:45:33,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 03:45:33,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 03:45:33,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 03:45:33,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 03:45:33,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 03:45:33,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 03:45:33,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 03:45:33,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 03:45:33,627 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 03:45:33,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 03:45:33,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 03:45:33,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:33,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:33,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:33,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 03:45:33,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:33,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:33,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:33,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:33,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 03:45:33,631 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 [2025-01-10 03:45:33,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 03:45:33,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 03:45:33,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 03:45:33,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 03:45:33,895 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 03:45:33,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:35,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/670e19cf3/18f2096f32bb4dcca9a982f3c37924db/FLAG6feed0990 [2025-01-10 03:45:35,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 03:45:35,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:35,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/670e19cf3/18f2096f32bb4dcca9a982f3c37924db/FLAG6feed0990 [2025-01-10 03:45:35,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/670e19cf3/18f2096f32bb4dcca9a982f3c37924db [2025-01-10 03:45:35,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 03:45:35,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 03:45:35,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:35,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 03:45:35,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 03:45:35,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:35" (1/1) ... [2025-01-10 03:45:35,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36be00c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:35, skipping insertion in model container [2025-01-10 03:45:35,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:35" (1/1) ... [2025-01-10 03:45:35,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 03:45:36,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:36,362 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 03:45:36,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:36,518 INFO L204 MainTranslator]: Completed translation [2025-01-10 03:45:36,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36 WrapperNode [2025-01-10 03:45:36,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:36,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:36,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 03:45:36,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 03:45:36,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,558 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-01-10 03:45:36,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:36,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 03:45:36,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 03:45:36,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 03:45:36,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,590 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]. [2025-01-10 03:45:36,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 03:45:36,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 03:45:36,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 03:45:36,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 03:45:36,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (1/1) ... [2025-01-10 03:45:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:36,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 03:45:36,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 03:45:36,693 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 03:45:36,693 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 03:45:36,693 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-01-10 03:45:36,693 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-01-10 03:45:36,693 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 03:45:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 03:45:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 03:45:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 03:45:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 03:45:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 03:45:36,789 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 03:45:36,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 03:45:36,899 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-10 03:45:36,899 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 03:45:36,906 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 03:45:36,907 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 03:45:36,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:36 BoogieIcfgContainer [2025-01-10 03:45:36,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 03:45:36,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 03:45:36,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 03:45:36,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 03:45:36,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:45:35" (1/3) ... [2025-01-10 03:45:36,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f47c3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:36, skipping insertion in model container [2025-01-10 03:45:36,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:36" (2/3) ... [2025-01-10 03:45:36,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f47c3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:36, skipping insertion in model container [2025-01-10 03:45:36,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:36" (3/3) ... [2025-01-10 03:45:36,914 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:36,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 03:45:36,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 03:45:36,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 03:45:36,987 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;@325279fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 03:45:36,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 03:45:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 33 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) [2025-01-10 03:45:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 03:45:36,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:36,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:36,997 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)] === [2025-01-10 03:45:37,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -355456766, now seen corresponding path program 1 times [2025-01-10 03:45:37,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:37,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944260864] [2025-01-10 03:45:37,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 03:45:37,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 03:45:37,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:37,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944260864] [2025-01-10 03:45:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944260864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210128210] [2025-01-10 03:45:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:37,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:37,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:37,343 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 33 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 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) [2025-01-10 03:45:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:37,417 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2025-01-10 03:45:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:37,419 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 [2025-01-10 03:45:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:37,426 INFO L225 Difference]: With dead ends: 62 [2025-01-10 03:45:37,426 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 03:45:37,428 INFO L434 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 [2025-01-10 03:45:37,433 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:37,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 03:45:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 03:45:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-01-10 03:45:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 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) [2025-01-10 03:45:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-01-10 03:45:37,470 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2025-01-10 03:45:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:37,472 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-01-10 03:45:37,472 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) [2025-01-10 03:45:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-01-10 03:45:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 03:45:37,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:37,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 03:45:37,473 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)] === [2025-01-10 03:45:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1865750189, now seen corresponding path program 1 times [2025-01-10 03:45:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:37,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756199084] [2025-01-10 03:45:37,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:37,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 03:45:37,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 03:45:37,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:37,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756199084] [2025-01-10 03:45:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756199084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510314375] [2025-01-10 03:45:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:37,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:37,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:37,563 INFO L87 Difference]: Start difference. First operand 32 states and 37 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) [2025-01-10 03:45:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:37,586 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-01-10 03:45:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:37,587 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 [2025-01-10 03:45:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:37,587 INFO L225 Difference]: With dead ends: 37 [2025-01-10 03:45:37,587 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 03:45:37,587 INFO L434 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 [2025-01-10 03:45:37,588 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 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 [2025-01-10 03:45:37,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 03:45:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 03:45:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 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) [2025-01-10 03:45:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-01-10 03:45:37,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2025-01-10 03:45:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-01-10 03:45:37,592 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) [2025-01-10 03:45:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-01-10 03:45:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 03:45:37,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:37,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:37,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 03:45:37,593 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)] === [2025-01-10 03:45:37,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1699768473, now seen corresponding path program 1 times [2025-01-10 03:45:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286167902] [2025-01-10 03:45:37,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:37,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 03:45:37,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 03:45:37,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:37,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 03:45:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286167902] [2025-01-10 03:45:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286167902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601233449] [2025-01-10 03:45:37,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 03:45:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:37,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:37,734 INFO L87 Difference]: Start difference. First operand 29 states and 32 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) [2025-01-10 03:45:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:37,751 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-01-10 03:45:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:37,752 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 [2025-01-10 03:45:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:37,752 INFO L225 Difference]: With dead ends: 29 [2025-01-10 03:45:37,753 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 03:45:37,753 INFO L434 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 [2025-01-10 03:45:37,754 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 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 [2025-01-10 03:45:37,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 03:45:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 03:45:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 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) [2025-01-10 03:45:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-10 03:45:37,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2025-01-10 03:45:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:37,757 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-10 03:45:37,757 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) [2025-01-10 03:45:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-10 03:45:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 03:45:37,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:37,786 INFO L218 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] [2025-01-10 03:45:37,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 03:45:37,787 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)] === [2025-01-10 03:45:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1153215040, now seen corresponding path program 1 times [2025-01-10 03:45:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 03:45:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281971973] [2025-01-10 03:45:37,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 03:45:37,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 03:45:37,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 03:45:37,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:37,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 03:45:37,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 03:45:37,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 03:45:37,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 03:45:37,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:37,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 03:45:37,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 03:45:37,853 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 03:45:37,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 03:45:37,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 03:45:37,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 03:45:37,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 03:45:37,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 03:45:37,858 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 03:45:37,877 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 03:45:37,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:45:37 BoogieIcfgContainer [2025-01-10 03:45:37,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 03:45:37,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 03:45:37,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 03:45:37,884 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 03:45:37,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:36" (3/4) ... [2025-01-10 03:45:37,887 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 03:45:37,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 03:45:37,888 INFO L158 Benchmark]: Toolchain (without parser) took 2171.64ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 97.2MB in the end (delta: 5.4MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-01-10 03:45:37,888 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:37,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.64ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 42.2MB in the end (delta: 60.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 03:45:37,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:37,889 INFO L158 Benchmark]: Boogie Preprocessor took 49.90ms. Allocated memory is still 142.6MB. Free memory was 39.5MB in the beginning and 37.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:37,889 INFO L158 Benchmark]: RCFGBuilder took 294.09ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 93.7MB in the end (delta: -56.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-01-10 03:45:37,890 INFO L158 Benchmark]: TraceAbstraction took 974.44ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 97.2MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:37,890 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 97.2MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:37,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.64ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 42.2MB in the end (delta: 60.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 142.6MB. Free memory was 42.2MB in the beginning and 39.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.90ms. Allocated memory is still 142.6MB. Free memory was 39.5MB in the beginning and 37.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.09ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 93.7MB in the end (delta: -56.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 974.44ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 97.2MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 97.2MB in the end (delta: 24.0kB). 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 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: 0.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 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=43occurred 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 03:45:37,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-10 03:45:40,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 03:45:40,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-01-10 03:45:40,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 03:45:40,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 03:45:40,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-01-10 03:45:40,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 03:45:40,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 03:45:40,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 03:45:40,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 03:45:40,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 03:45:40,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 03:45:40,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 03:45:40,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 03:45:40,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 03:45:40,416 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 03:45:40,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:40,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 03:45:40,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 03:45:40,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:40,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 03:45:40,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 [2025-01-10 03:45:40,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 03:45:40,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 03:45:40,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 03:45:40,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 03:45:40,721 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 03:45:40,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:42,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdf44f6d2/79b139c9a35949cfb20968f65cc4ba61/FLAGa0451cf55 [2025-01-10 03:45:42,466 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 03:45:42,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:42,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdf44f6d2/79b139c9a35949cfb20968f65cc4ba61/FLAGa0451cf55 [2025-01-10 03:45:42,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cdf44f6d2/79b139c9a35949cfb20968f65cc4ba61 [2025-01-10 03:45:42,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 03:45:42,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 03:45:42,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:42,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 03:45:42,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 03:45:42,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:42" (1/1) ... [2025-01-10 03:45:42,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8236e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:42, skipping insertion in model container [2025-01-10 03:45:42,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:42" (1/1) ... [2025-01-10 03:45:42,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 03:45:43,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:43,260 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 03:45:43,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 03:45:43,433 INFO L204 MainTranslator]: Completed translation [2025-01-10 03:45:43,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43 WrapperNode [2025-01-10 03:45:43,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 03:45:43,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:43,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 03:45:43,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 03:45:43,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,470 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2025-01-10 03:45:43,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 03:45:43,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 03:45:43,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 03:45:43,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 03:45:43,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,488 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]. [2025-01-10 03:45:43,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 03:45:43,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 03:45:43,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 03:45:43,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 03:45:43,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (1/1) ... [2025-01-10 03:45:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 03:45:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:43,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 03:45:43,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 03:45:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 03:45:43,552 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 03:45:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-01-10 03:45:43,553 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-01-10 03:45:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 03:45:43,553 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 03:45:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 03:45:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 03:45:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 03:45:43,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 03:45:43,697 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 03:45:43,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 03:45:43,830 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 03:45:43,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 03:45:43,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 03:45:43,838 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 03:45:43,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:43 BoogieIcfgContainer [2025-01-10 03:45:43,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 03:45:43,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 03:45:43,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 03:45:43,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 03:45:43,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:45:42" (1/3) ... [2025-01-10 03:45:43,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51bd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:43, skipping insertion in model container [2025-01-10 03:45:43,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:43" (2/3) ... [2025-01-10 03:45:43,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51bd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:43, skipping insertion in model container [2025-01-10 03:45:43,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:43" (3/3) ... [2025-01-10 03:45:43,848 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i [2025-01-10 03:45:43,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 03:45:43,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_12_bad.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 03:45:43,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 03:45:43,937 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;@3d42b2c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 03:45:43,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 03:45:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 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) [2025-01-10 03:45:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 03:45:43,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:43,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:43,959 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)] === [2025-01-10 03:45:43,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1813595353, now seen corresponding path program 1 times [2025-01-10 03:45:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 03:45:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70512601] [2025-01-10 03:45:43,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:43,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:44,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 03:45:44,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 03:45:44,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 03:45:44,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 03:45:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:44,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 03:45:44,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:44,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:44,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 03:45:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70512601] [2025-01-10 03:45:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70512601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 03:45:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815845149] [2025-01-10 03:45:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 03:45:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 03:45:44,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 03:45:44,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 03:45:44,208 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 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) [2025-01-10 03:45:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:44,222 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-01-10 03:45:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 03:45:44,224 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 [2025-01-10 03:45:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:44,228 INFO L225 Difference]: With dead ends: 41 [2025-01-10 03:45:44,228 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 03:45:44,231 INFO L434 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 [2025-01-10 03:45:44,232 INFO L435 NwaCegarLoop]: 48 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, 48 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 [2025-01-10 03:45:44,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 03:45:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 03:45:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) 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) [2025-01-10 03:45:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-10 03:45:44,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2025-01-10 03:45:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-10 03:45:44,261 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) [2025-01-10 03:45:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-01-10 03:45:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 03:45:44,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:44,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:44,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 03:45:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:44,467 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)] === [2025-01-10 03:45:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -386881026, now seen corresponding path program 1 times [2025-01-10 03:45:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 03:45:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582108945] [2025-01-10 03:45:44,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:44,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 03:45:44,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 03:45:44,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 03:45:44,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 03:45:44,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:44,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:44,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:44,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:44,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 03:45:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582108945] [2025-01-10 03:45:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582108945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771473870] [2025-01-10 03:45:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:44,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 03:45:44,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:44,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:44,693 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2025-01-10 03:45:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:44,745 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-01-10 03:45:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:44,750 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 [2025-01-10 03:45:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:44,751 INFO L225 Difference]: With dead ends: 31 [2025-01-10 03:45:44,751 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 03:45:44,751 INFO L434 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 [2025-01-10 03:45:44,752 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 03:45:44,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 03:45:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-01-10 03:45:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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) [2025-01-10 03:45:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-01-10 03:45:44,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2025-01-10 03:45:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:44,764 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-01-10 03:45:44,764 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) [2025-01-10 03:45:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-01-10 03:45:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 03:45:44,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:44,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:44,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 03:45:44,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:44,970 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)] === [2025-01-10 03:45:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash 891837418, now seen corresponding path program 1 times [2025-01-10 03:45:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 03:45:44,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381273949] [2025-01-10 03:45:44,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:44,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:44,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 03:45:44,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 03:45:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 03:45:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 03:45:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 03:45:45,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 03:45:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 03:45:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 03:45:45,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 03:45:45,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 03:45:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381273949] [2025-01-10 03:45:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381273949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 03:45:45,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 03:45:45,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 03:45:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211130308] [2025-01-10 03:45:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 03:45:45,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 03:45:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 03:45:45,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 03:45:45,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 03:45:45,075 INFO L87 Difference]: Start difference. First operand 27 states and 32 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) [2025-01-10 03:45:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 03:45:45,093 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-01-10 03:45:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 03:45:45,093 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 [2025-01-10 03:45:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 03:45:45,094 INFO L225 Difference]: With dead ends: 31 [2025-01-10 03:45:45,094 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 03:45:45,094 INFO L434 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 [2025-01-10 03:45:45,095 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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 [2025-01-10 03:45:45,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 03:45:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 03:45:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 03:45:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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) [2025-01-10 03:45:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-10 03:45:45,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-01-10 03:45:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 03:45:45,099 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-10 03:45:45,099 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) [2025-01-10 03:45:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-10 03:45:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 03:45:45,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 03:45:45,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 03:45:45,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 03:45:45,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:45,301 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)] === [2025-01-10 03:45:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 03:45:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1487227331, now seen corresponding path program 1 times [2025-01-10 03:45:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 03:45:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443130215] [2025-01-10 03:45:45,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 03:45:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 03:45:45,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 03:45:45,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 03:45:45,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 03:45:45,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 03:45:45,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 03:45:45,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 03:45:45,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 03:45:45,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 03:45:45,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 03:45:45,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 03:45:45,446 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 03:45:45,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 03:45:45,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 03:45:45,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 03:45:45,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 03:45:45,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 03:45:45,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 03:45:45,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 03:45:45,656 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 03:45:45,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 03:45:45,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:45:45 BoogieIcfgContainer [2025-01-10 03:45:45,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 03:45:45,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 03:45:45,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 03:45:45,695 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 03:45:45,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:43" (3/4) ... [2025-01-10 03:45:45,700 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 03:45:45,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 03:45:45,705 INFO L158 Benchmark]: Toolchain (without parser) took 3197.29ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 46.4MB in the end (delta: 41.6MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-01-10 03:45:45,705 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:45,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 925.90ms. Allocated memory is still 117.4MB. Free memory was 87.8MB in the beginning and 74.1MB in the end (delta: 13.6MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-01-10 03:45:45,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.86ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:45,706 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 69.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:45:45,706 INFO L158 Benchmark]: RCFGBuilder took 338.99ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 53.9MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 03:45:45,706 INFO L158 Benchmark]: TraceAbstraction took 1854.09ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 47.0MB in the end (delta: 6.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-01-10 03:45:45,706 INFO L158 Benchmark]: Witness Printer took 9.02ms. Allocated memory is still 117.4MB. Free memory was 47.0MB in the beginning and 46.4MB in the end (delta: 608.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 03:45:45,707 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.25ms. Allocated memory is still 83.9MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 925.90ms. Allocated memory is still 117.4MB. Free memory was 87.8MB in the beginning and 74.1MB in the end (delta: 13.6MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.86ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 69.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 338.99ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 53.9MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1854.09ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 47.0MB in the end (delta: 6.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 9.02ms. Allocated memory is still 117.4MB. Free memory was 47.0MB in the beginning and 46.4MB in the end (delta: 608.0kB). 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 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, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, 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.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 110 mSDtfsCounter, 27 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=41occurred 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 183 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 03:45:45,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample