./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/CWE191_Integer_Underflow__int_min_sub_17_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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '5a345d1cea2447ad34381dce7c6b0396a6be65a08e2f7b16f8235d714651fcda'] 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/CWE191_Integer_Underflow__int_min_sub_17_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 5a345d1cea2447ad34381dce7c6b0396a6be65a08e2f7b16f8235d714651fcda --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:54:14,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:54:14,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 22:54:14,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:54:14,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:54:14,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:54:14,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:54:14,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:54:14,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:54:14,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:54:14,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:54:14,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:54:14,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:54:14,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:54:14,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:54:14,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:54:14,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:54:14,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:54:14,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:54:14,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:54:14,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:54:14,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:54:14,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:54:14,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:54:14,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 22:54:14,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 22:54:14,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:54:14,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:54:14,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:54:14,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:54:14,659 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 -> 5a345d1cea2447ad34381dce7c6b0396a6be65a08e2f7b16f8235d714651fcda [2024-11-07 22:54:14,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:54:14,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:54:14,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:54:14,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:54:14,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:54:14,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:16,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:54:16,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:54:16,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:16,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/122f9bcae/65b4ffa95a4a42bcaf2f5f3e74c30645/FLAGe2bc1a4c6 [2024-11-07 22:54:16,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/122f9bcae/65b4ffa95a4a42bcaf2f5f3e74c30645 [2024-11-07 22:54:16,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:54:16,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:54:16,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:54:16,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:54:16,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:54:16,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:16" (1/1) ... [2024-11-07 22:54:16,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5e86e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:16, skipping insertion in model container [2024-11-07 22:54:16,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:16" (1/1) ... [2024-11-07 22:54:16,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:54:17,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:54:17,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:54:17,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:54:17,201 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:54:17,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17 WrapperNode [2024-11-07 22:54:17,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:54:17,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:54:17,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:54:17,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:54:17,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,257 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-07 22:54:17,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:54:17,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:54:17,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:54:17,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:54:17,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,276 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:54:17,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:54:17,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:54:17,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:54:17,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:54:17,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (1/1) ... [2024-11-07 22:54:17,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:54:17,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:54:17,319 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) [2024-11-07 22:54:17,323 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 [2024-11-07 22:54:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:54:17,349 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:54:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:54:17,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:54:17,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:54:17,469 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:54:17,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:54:17,566 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-07 22:54:17,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:54:17,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:54:17,572 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 22:54:17,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:17 BoogieIcfgContainer [2024-11-07 22:54:17,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:54:17,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:54:17,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:54:17,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:54:17,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:54:16" (1/3) ... [2024-11-07 22:54:17,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7773790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:17, skipping insertion in model container [2024-11-07 22:54:17,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:17" (2/3) ... [2024-11-07 22:54:17,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7773790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:17, skipping insertion in model container [2024-11-07 22:54:17,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:17" (3/3) ... [2024-11-07 22:54:17,580 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:17,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:54:17,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 22:54:17,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:54:17,638 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;@26b0e874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:54:17,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 22:54:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 22:54:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 22:54:17,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:17,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:17,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-07 22:54:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:54:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370126234] [2024-11-07 22:54:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:54:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:54:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:54:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370126234] [2024-11-07 22:54:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370126234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:54:17,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:54:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:54:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975434068] [2024-11-07 22:54:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:54:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:54:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:54:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:54:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:54:17,958 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:54:17,993 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-07 22:54:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:54:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 22:54:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:54:18,000 INFO L225 Difference]: With dead ends: 60 [2024-11-07 22:54:18,000 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 22:54:18,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:54:18,006 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:54:18,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:54:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 22:54:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 22:54:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 27 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-07 22:54:18,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 11 [2024-11-07 22:54:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:54:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-07 22:54:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-07 22:54:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 22:54:18,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:18,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 22:54:18,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1379853943, now seen corresponding path program 1 times [2024-11-07 22:54:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:54:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342335448] [2024-11-07 22:54:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:54:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:54:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:54:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342335448] [2024-11-07 22:54:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342335448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 22:54:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887408775] [2024-11-07 22:54:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 22:54:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:54:18,173 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) [2024-11-07 22:54:18,174 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 [2024-11-07 22:54:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:18,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 22:54:18,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:54:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:18,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:54:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887408775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:54:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 22:54:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 22:54:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610376447] [2024-11-07 22:54:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:54:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 22:54:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:54:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 22:54:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 22:54:18,319 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:54:18,336 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-07 22:54:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 22:54:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 22:54:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:54:18,337 INFO L225 Difference]: With dead ends: 43 [2024-11-07 22:54:18,338 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 22:54:18,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 22:54:18,339 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:54:18,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:54:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 22:54:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 22:54:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-07 22:54:18,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2024-11-07 22:54:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:54:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-07 22:54:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-07 22:54:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 22:54:18,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:18,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:18,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 22:54:18,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 22:54:18,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:18,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash -174252117, now seen corresponding path program 1 times [2024-11-07 22:54:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:54:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296860664] [2024-11-07 22:54:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:54:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:54:18,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:54:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:54:18,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 22:54:18,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:54:18,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 22:54:18,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 22:54:18,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 22:54:18,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 22:54:18,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 22:54:18,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 22:54:18,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 22:54:18,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 22:54:18,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:54:18,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:54:18 BoogieIcfgContainer [2024-11-07 22:54:18,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:54:18,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:54:18,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:54:18,632 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:54:18,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:17" (3/4) ... [2024-11-07 22:54:18,634 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:54:18,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:54:18,636 INFO L158 Benchmark]: Toolchain (without parser) took 2282.06ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 88.9MB in the beginning and 90.9MB in the end (delta: -2.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-07 22:54:18,637 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:18,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 847.52ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 72.2MB in the end (delta: 16.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-11-07 22:54:18,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.83ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:54:18,637 INFO L158 Benchmark]: Boogie Preprocessor took 24.80ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 68.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:18,638 INFO L158 Benchmark]: RCFGBuilder took 289.08ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 56.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:54:18,639 INFO L158 Benchmark]: TraceAbstraction took 1056.00ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 90.9MB in the end (delta: -35.1MB). Peak memory consumption was 599.8kB. Max. memory is 16.1GB. [2024-11-07 22:54:18,639 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 151.0MB. Free memory was 90.9MB in the beginning and 90.9MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:18,640 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.51ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 847.52ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 72.2MB in the end (delta: 16.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.83ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 69.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.80ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 68.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.08ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 56.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.00ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 90.9MB in the end (delta: -35.1MB). Peak memory consumption was 599.8kB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 151.0MB. Free memory was 90.9MB in the beginning and 90.9MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE191_Integer_Underflow__int_min_sub_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = (-0x7fffffff - 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 52 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 22:54:18,660 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 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/CWE191_Integer_Underflow__int_min_sub_17_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 5a345d1cea2447ad34381dce7c6b0396a6be65a08e2f7b16f8235d714651fcda --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:54:20,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:54:20,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 22:54:20,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:54:20,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:54:20,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 22:54:20,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:54:20,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:54:20,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:54:20,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:54:20,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:54:20,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:54:20,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:54:20,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:54:20,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:54:20,564 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:54:20,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 22:54:20,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:54:20,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:54:20,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:54:20,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:54:20,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:54:20,567 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 -> 5a345d1cea2447ad34381dce7c6b0396a6be65a08e2f7b16f8235d714651fcda [2024-11-07 22:54:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:54:20,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:54:20,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:54:20,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:54:20,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:54:20,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:22,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:54:22,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:54:22,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:22,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aae4086fd/bf455d95659d4e1b9ad229e3d85478d3/FLAGa8104ed0a [2024-11-07 22:54:22,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aae4086fd/bf455d95659d4e1b9ad229e3d85478d3 [2024-11-07 22:54:22,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:54:22,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:54:22,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:54:22,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:54:22,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:54:22,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:22" (1/1) ... [2024-11-07 22:54:22,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2973cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:22, skipping insertion in model container [2024-11-07 22:54:22,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:22" (1/1) ... [2024-11-07 22:54:22,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:54:23,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:54:23,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:54:23,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:54:23,465 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:54:23,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23 WrapperNode [2024-11-07 22:54:23,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:54:23,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:54:23,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:54:23,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:54:23,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,520 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-07 22:54:23,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:54:23,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:54:23,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:54:23,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:54:23,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,541 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:54:23,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:54:23,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:54:23,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:54:23,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:54:23,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (1/1) ... [2024-11-07 22:54:23,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:54:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:54:23,598 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) [2024-11-07 22:54:23,602 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 [2024-11-07 22:54:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:54:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:54:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:54:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:54:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:54:23,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:54:23,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:54:23,870 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 22:54:23,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:54:23,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:54:23,876 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 22:54:23,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:23 BoogieIcfgContainer [2024-11-07 22:54:23,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:54:23,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:54:23,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:54:23,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:54:23,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:54:22" (1/3) ... [2024-11-07 22:54:23,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29218e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:23, skipping insertion in model container [2024-11-07 22:54:23,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:23" (2/3) ... [2024-11-07 22:54:23,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29218e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:23, skipping insertion in model container [2024-11-07 22:54:23,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:23" (3/3) ... [2024-11-07 22:54:23,884 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_sub_17_bad.i [2024-11-07 22:54:23,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:54:23,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 22:54:23,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:54:23,947 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;@7ed41c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:54:23,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 22:54:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 22:54:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 22:54:23,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:23,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:23,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-07 22:54:23,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:54:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801443657] [2024-11-07 22:54:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:23,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:54:23,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:54:23,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 22:54:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:24,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 22:54:24,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:54:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:24,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:54:24,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:54:24,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801443657] [2024-11-07 22:54:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801443657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:54:24,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:54:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 22:54:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255728893] [2024-11-07 22:54:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:54:24,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 22:54:24,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:54:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 22:54:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:54:24,111 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:54:24,124 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-07 22:54:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 22:54:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 22:54:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:54:24,130 INFO L225 Difference]: With dead ends: 52 [2024-11-07 22:54:24,130 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 22:54:24,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:54:24,136 INFO L432 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:54:24,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:54:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 22:54:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 22:54:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-07 22:54:24,167 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2024-11-07 22:54:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:54:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-07 22:54:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-07 22:54:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 22:54:24,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:24,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:24,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 22:54:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:24,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1357787559, now seen corresponding path program 1 times [2024-11-07 22:54:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:54:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046359362] [2024-11-07 22:54:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:24,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:54:24,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:54:24,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 22:54:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:24,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 22:54:24,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:54:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:24,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:54:24,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:54:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046359362] [2024-11-07 22:54:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046359362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:54:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:54:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:54:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770073371] [2024-11-07 22:54:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:54:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 22:54:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:54:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 22:54:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 22:54:24,475 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:54:24,489 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-07 22:54:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 22:54:24,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 22:54:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:54:24,492 INFO L225 Difference]: With dead ends: 35 [2024-11-07 22:54:24,492 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 22:54:24,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 22:54:24,492 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:54:24,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:54:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 22:54:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-07 22:54:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-07 22:54:24,499 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2024-11-07 22:54:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:54:24,499 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-07 22:54:24,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-07 22:54:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 22:54:24,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:24,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:24,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 22:54:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:24,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1357839005, now seen corresponding path program 1 times [2024-11-07 22:54:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:54:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973403255] [2024-11-07 22:54:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:54:24,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:54:24,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 22:54:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:54:24,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:54:24,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:54:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:54:24,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:54:24,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:54:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973403255] [2024-11-07 22:54:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973403255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:54:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:54:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:54:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483351664] [2024-11-07 22:54:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:54:24,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:54:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:54:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:54:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:54:24,796 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:54:24,824 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-07 22:54:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:54:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 22:54:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:54:24,825 INFO L225 Difference]: With dead ends: 28 [2024-11-07 22:54:24,825 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 22:54:24,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:54:24,826 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:54:24,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:54:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 22:54:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 22:54:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-07 22:54:24,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2024-11-07 22:54:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:54:24,830 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-07 22:54:24,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:54:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-07 22:54:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 22:54:24,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:54:24,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:54:24,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 22:54:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:25,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:54:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:54:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -174252117, now seen corresponding path program 1 times [2024-11-07 22:54:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:54:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883657703] [2024-11-07 22:54:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:54:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:54:25,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:54:25,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 22:54:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:54:25,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:54:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:54:25,132 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 22:54:25,132 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:54:25,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 22:54:25,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 22:54:25,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 22:54:25,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 22:54:25,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 22:54:25,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 22:54:25,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 22:54:25,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:54:25,337 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 22:54:25,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:54:25,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:54:25 BoogieIcfgContainer [2024-11-07 22:54:25,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:54:25,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:54:25,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:54:25,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:54:25,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:23" (3/4) ... [2024-11-07 22:54:25,364 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:54:25,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:54:25,365 INFO L158 Benchmark]: Toolchain (without parser) took 2585.66ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 44.9MB in the end (delta: 44.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-11-07 22:54:25,365 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:25,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.05ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 59.2MB in the end (delta: 29.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-07 22:54:25,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.47ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 56.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:25,365 INFO L158 Benchmark]: Boogie Preprocessor took 37.16ms. Allocated memory is still 117.4MB. Free memory was 56.2MB in the beginning and 54.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:25,366 INFO L158 Benchmark]: RCFGBuilder took 317.35ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 83.7MB in the end (delta: -29.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-07 22:54:25,366 INFO L158 Benchmark]: TraceAbstraction took 1483.28ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 45.5MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-07 22:54:25,366 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 117.4MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:54:25,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.05ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 59.2MB in the end (delta: 29.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.47ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 56.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.16ms. Allocated memory is still 117.4MB. Free memory was 56.2MB in the beginning and 54.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.35ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 83.7MB in the end (delta: -29.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1483.28ms. Allocated memory is still 117.4MB. Free memory was 83.2MB in the beginning and 45.5MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 117.4MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL CWE191_Integer_Underflow__int_min_sub_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = (-0x7fffffff - 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] data - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 22:54:25,387 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample