./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_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/CWE190_Integer_Overflow__int_fscanf_preinc_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', '085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_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 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:55:20,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:55:20,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 21:55:20,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:55:20,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:55:20,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:55:20,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:55:20,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:55:20,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:55:20,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:55:20,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:55:20,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:55:20,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:55:20,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:55:20,882 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:55:20,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:55:20,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:55:20,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:55:20,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:55:20,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:55:20,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:55:20,884 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 -> 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf [2024-11-07 21:55:21,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:55:21,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:55:21,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:55:21,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:55:21,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:55:21,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:22,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:55:22,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:55:22,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:22,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dccd2573/24bcb7aa22394020a30fb965338e15ae/FLAG5631b2dee [2024-11-07 21:55:22,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dccd2573/24bcb7aa22394020a30fb965338e15ae [2024-11-07 21:55:22,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:55:22,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:55:22,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:55:22,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:55:22,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:55:22,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:55:22" (1/1) ... [2024-11-07 21:55:22,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7487f9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:22, skipping insertion in model container [2024-11-07 21:55:22,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:55:22" (1/1) ... [2024-11-07 21:55:22,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:55:23,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:55:23,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:55:23,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:55:23,862 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:55:23,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23 WrapperNode [2024-11-07 21:55:23,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:55:23,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:55:23,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:55:23,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:55:23,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,909 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-07 21:55:23,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:55:23,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:55:23,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:55:23,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:55:23,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,939 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 21:55:23,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:55:23,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:55:23,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:55:23,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:55:23,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (1/1) ... [2024-11-07 21:55:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:55:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:55:23,997 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 21:55:23,999 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 21:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 21:55:24,017 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 21:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:55:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:55:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:55:24,125 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:55:24,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:55:24,242 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-07 21:55:24,242 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:55:24,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:55:24,248 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 21:55:24,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:24 BoogieIcfgContainer [2024-11-07 21:55:24,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:55:24,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:55:24,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:55:24,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:55:24,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:55:22" (1/3) ... [2024-11-07 21:55:24,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c995d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:55:24, skipping insertion in model container [2024-11-07 21:55:24,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:23" (2/3) ... [2024-11-07 21:55:24,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c995d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:55:24, skipping insertion in model container [2024-11-07 21:55:24,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:24" (3/3) ... [2024-11-07 21:55:24,258 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:24,274 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:55:24,275 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 21:55:24,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:55:24,341 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;@42d21274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:55:24,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 21:55:24,346 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 21:55:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:55:24,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:24,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:24,355 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 21:55:24,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-07 21:55:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:55:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503608798] [2024-11-07 21:55:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:55:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:55:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:24,692 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 21:55:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:55:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503608798] [2024-11-07 21:55:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503608798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:55:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:55:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:55:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902256063] [2024-11-07 21:55:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:55:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:55:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:55:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:55:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:55:24,723 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 21:55:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:24,787 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-07 21:55:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:55:24,791 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 21:55:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:24,796 INFO L225 Difference]: With dead ends: 60 [2024-11-07 21:55:24,796 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 21:55:24,800 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 21:55:24,803 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 21:55:24,804 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 21:55:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 21:55:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 21:55:24,835 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 21:55:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-07 21:55:24,842 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 11 [2024-11-07 21:55:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:24,843 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-07 21:55:24,843 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 21:55:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-07 21:55:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 21:55:24,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:24,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:24,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 21:55:24,846 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 21:55:24,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1379853943, now seen corresponding path program 1 times [2024-11-07 21:55:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:55:24,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731078077] [2024-11-07 21:55:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:55:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:55:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:24,997 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 21:55:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:55:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731078077] [2024-11-07 21:55:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731078077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 21:55:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677731849] [2024-11-07 21:55:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 21:55:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:55:25,003 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 21:55:25,005 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 21:55:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:25,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:55:25,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:55:25,182 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 21:55:25,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:55:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677731849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:55:25,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 21:55:25,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 21:55:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338673266] [2024-11-07 21:55:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:55:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 21:55:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:55:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 21:55:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 21:55:25,186 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 21:55:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:25,208 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-07 21:55:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:55:25,210 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 21:55:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:25,211 INFO L225 Difference]: With dead ends: 43 [2024-11-07 21:55:25,211 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 21:55:25,211 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 21:55:25,212 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 21:55:25,212 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 21:55:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 21:55:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 21:55:25,217 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 21:55:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-07 21:55:25,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2024-11-07 21:55:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:25,219 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-07 21:55:25,219 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 21:55:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-07 21:55:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 21:55:25,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:25,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:25,239 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 21:55:25,421 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 21:55:25,422 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 21:55:25,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash -174252117, now seen corresponding path program 1 times [2024-11-07 21:55:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:55:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062613368] [2024-11-07 21:55:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:55:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:25,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 21:55:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:55:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 21:55:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062613368] [2024-11-07 21:55:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062613368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:55:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:55:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 21:55:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706566549] [2024-11-07 21:55:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:55:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 21:55:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 21:55:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 21:55:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:55:25,511 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21:55:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:25,526 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-07 21:55:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 21:55:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-07 21:55:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:25,528 INFO L225 Difference]: With dead ends: 25 [2024-11-07 21:55:25,528 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 21:55:25,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 21:55:25,529 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:55:25,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:55:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 21:55:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 21:55:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 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 21:55:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-07 21:55:25,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2024-11-07 21:55:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-07 21:55:25,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21:55:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-07 21:55:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 21:55:25,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:25,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 21:55:25,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 21:55:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1106848259, now seen corresponding path program 1 times [2024-11-07 21:55:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 21:55:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750108862] [2024-11-07 21:55:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 21:55:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:55:25,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 21:55:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:55:25,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 21:55:25,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 21:55:25,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 21:55:25,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 21:55:25,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 21:55:25,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 21:55:25,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 21:55:25,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 21:55:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 21:55:25,586 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 21:55:25,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:55:25,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:55:25 BoogieIcfgContainer [2024-11-07 21:55:25,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:55:25,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:55:25,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:55:25,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:55:25,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:24" (3/4) ... [2024-11-07 21:55:25,617 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 21:55:25,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:55:25,619 INFO L158 Benchmark]: Toolchain (without parser) took 2700.60ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 89.4MB in the beginning and 97.3MB in the end (delta: -7.9MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-11-07 21:55:25,620 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:25,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 942.93ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 72.1MB in the end (delta: 17.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-07 21:55:25,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.94ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:55:25,621 INFO L158 Benchmark]: Boogie Preprocessor took 38.78ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 68.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:25,621 INFO L158 Benchmark]: RCFGBuilder took 298.87ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 56.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 21:55:25,622 INFO L158 Benchmark]: TraceAbstraction took 1363.41ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 55.5MB in the beginning and 97.9MB in the end (delta: -42.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-07 21:55:25,622 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 97.3MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:25,624 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.95ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 942.93ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 72.1MB in the end (delta: 17.1MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.94ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.78ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 68.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.87ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 56.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1363.41ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 55.5MB in the beginning and 97.9MB in the end (delta: -42.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 97.3MB 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 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_preinc_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 [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 74 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/7 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 21:55:25,647 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/CWE190_Integer_Overflow__int_fscanf_preinc_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 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 21:55:27,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 21:55:27,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 21:55:27,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 21:55:27,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 21:55:27,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 21:55:27,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 21:55:27,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 21:55:27,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 21:55:27,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 21:55:27,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 21:55:27,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 21:55:27,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 21:55:27,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 21:55:27,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 21:55:27,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 21:55:27,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 21:55:27,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 21:55:27,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:55:27,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 21:55:27,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 21:55:27,905 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 -> 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf [2024-11-07 21:55:28,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 21:55:28,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 21:55:28,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 21:55:28,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 21:55:28,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 21:55:28,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:29,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 21:55:29,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 21:55:29,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:29,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86ed9390a/f782c958a0d94d069a592e383834d23e/FLAG4f11088f0 [2024-11-07 21:55:29,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86ed9390a/f782c958a0d94d069a592e383834d23e [2024-11-07 21:55:29,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 21:55:29,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 21:55:29,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 21:55:29,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 21:55:29,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 21:55:29,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:55:29" (1/1) ... [2024-11-07 21:55:29,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed89c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:29, skipping insertion in model container [2024-11-07 21:55:29,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:55:29" (1/1) ... [2024-11-07 21:55:29,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 21:55:30,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:55:30,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 21:55:30,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 21:55:30,938 INFO L204 MainTranslator]: Completed translation [2024-11-07 21:55:30,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30 WrapperNode [2024-11-07 21:55:30,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 21:55:30,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 21:55:30,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 21:55:30,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 21:55:30,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:30,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,003 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-11-07 21:55:31,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 21:55:31,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 21:55:31,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 21:55:31,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 21:55:31,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,026 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 21:55:31,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 21:55:31,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 21:55:31,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 21:55:31,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 21:55:31,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (1/1) ... [2024-11-07 21:55:31,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 21:55:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 21:55:31,088 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 21:55:31,094 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 21:55:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 21:55:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 21:55:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 21:55:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 21:55:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 21:55:31,242 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 21:55:31,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 21:55:31,384 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 21:55:31,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 21:55:31,394 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 21:55:31,394 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 21:55:31,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:31 BoogieIcfgContainer [2024-11-07 21:55:31,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 21:55:31,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 21:55:31,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 21:55:31,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 21:55:31,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:55:29" (1/3) ... [2024-11-07 21:55:31,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87d5012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:55:31, skipping insertion in model container [2024-11-07 21:55:31,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:55:30" (2/3) ... [2024-11-07 21:55:31,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87d5012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:55:31, skipping insertion in model container [2024-11-07 21:55:31,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:31" (3/3) ... [2024-11-07 21:55:31,405 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-11-07 21:55:31,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 21:55:31,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 21:55:31,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 21:55:31,484 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;@757a10a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 21:55:31,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 21:55:31,489 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 21:55:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 21:55:31,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:31,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:31,497 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 21:55:31,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-07 21:55:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:55:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823873764] [2024-11-07 21:55:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:31,511 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 21:55:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:55:31,515 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 21:55:31,516 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 21:55:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:31,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 21:55:31,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:55:31,640 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 21:55:31,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:55:31,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 21:55:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823873764] [2024-11-07 21:55:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823873764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:55:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:55:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 21:55:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628624820] [2024-11-07 21:55:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:55:31,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 21:55:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 21:55:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 21:55:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 21:55:31,686 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 21:55:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:31,701 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-07 21:55:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 21:55:31,703 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 21:55:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:31,708 INFO L225 Difference]: With dead ends: 52 [2024-11-07 21:55:31,708 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 21:55:31,711 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 21:55:31,715 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 21:55:31,717 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 21:55:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 21:55:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 21:55:31,745 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 21:55:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-07 21:55:31,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2024-11-07 21:55:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-07 21:55:31,752 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 21:55:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-07 21:55:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 21:55:31,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:31,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:31,757 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 21:55:31,956 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 21:55:31,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 21:55:31,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1357839005, now seen corresponding path program 1 times [2024-11-07 21:55:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:55:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845900960] [2024-11-07 21:55:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:31,958 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 21:55:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:55:31,961 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 21:55:31,962 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 21:55:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:32,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 21:55:32,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:55:32,051 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 21:55:32,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 21:55:32,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 21:55:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845900960] [2024-11-07 21:55:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845900960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 21:55:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 21:55:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 21:55:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81648719] [2024-11-07 21:55:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 21:55:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 21:55:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 21:55:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 21:55:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 21:55:32,053 INFO L87 Difference]: Start difference. First operand 23 states and 25 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 21:55:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:32,081 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-07 21:55:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 21:55:32,083 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 21:55:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:32,083 INFO L225 Difference]: With dead ends: 38 [2024-11-07 21:55:32,083 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 21:55:32,084 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 21:55:32,084 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:55:32,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:55:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 21:55:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 21:55:32,091 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 21:55:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-07 21:55:32,093 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2024-11-07 21:55:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:32,093 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-07 21:55:32,093 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 21:55:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-07 21:55:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 21:55:32,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:32,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:32,098 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 21:55:32,294 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 21:55:32,294 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 21:55:32,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash -174200671, now seen corresponding path program 1 times [2024-11-07 21:55:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:55:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866366573] [2024-11-07 21:55:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:32,296 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 21:55:32,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:55:32,300 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 21:55:32,301 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 21:55:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 21:55:32,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 21:55:32,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 21:55:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:55:32,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 21:55:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 21:55:32,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 21:55:32,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866366573] [2024-11-07 21:55:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866366573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 21:55:32,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 21:55:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 21:55:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442814495] [2024-11-07 21:55:32,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 21:55:32,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 21:55:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 21:55:32,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 21:55:32,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 21:55:32,482 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 21:55:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 21:55:32,510 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-07 21:55:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 21:55:32,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 21:55:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 21:55:32,511 INFO L225 Difference]: With dead ends: 38 [2024-11-07 21:55:32,512 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 21:55:32,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 21:55:32,513 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 21:55:32,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 21:55:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 21:55:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 21:55:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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 21:55:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-07 21:55:32,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2024-11-07 21:55:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 21:55:32,521 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-07 21:55:32,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 21:55:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-07 21:55:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 21:55:32,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 21:55:32,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 21:55:32,526 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 21:55:32,722 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 21:55:32,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 21:55:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 21:55:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1106848259, now seen corresponding path program 1 times [2024-11-07 21:55:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 21:55:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114937537] [2024-11-07 21:55:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 21:55:32,723 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 21:55:32,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 21:55:32,727 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 21:55:32,729 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 21:55:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:55:32,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 21:55:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 21:55:32,846 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 21:55:32,846 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 21:55:32,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 21:55:32,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 21:55:32,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 21:55:32,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 21:55:32,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 21:55:32,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 21:55:32,854 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 21:55:33,053 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 21:55:33,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 21:55:33,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 21:55:33,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:55:33 BoogieIcfgContainer [2024-11-07 21:55:33,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 21:55:33,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 21:55:33,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 21:55:33,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 21:55:33,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:55:31" (3/4) ... [2024-11-07 21:55:33,091 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 21:55:33,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 21:55:33,093 INFO L158 Benchmark]: Toolchain (without parser) took 3224.25ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 53.6MB in the end (delta: 36.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-11-07 21:55:33,093 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory was 65.2MB in the beginning and 65.1MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:33,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1070.20ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-11-07 21:55:33,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.33ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:33,095 INFO L158 Benchmark]: Boogie Preprocessor took 44.26ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:33,095 INFO L158 Benchmark]: RCFGBuilder took 346.44ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 59.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 21:55:33,095 INFO L158 Benchmark]: TraceAbstraction took 1689.89ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 53.6MB in the end (delta: 5.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-07 21:55:33,095 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 53.6MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 21:55:33,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory was 65.2MB in the beginning and 65.1MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1070.20ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 77.2MB in the end (delta: 13.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.33ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.26ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.44ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 59.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1689.89ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 53.6MB in the end (delta: 5.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 53.6MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_preinc_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 [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 72 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 6/8 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 21:55:33,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample