./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_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_max_multiply_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', '599d022dfa4223d8bb6a36b0b4d4c23924feae264573646d696cb51987d3d57a'] 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_max_multiply_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 599d022dfa4223d8bb6a36b0b4d4c23924feae264573646d696cb51987d3d57a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:08:16,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:08:16,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 22:08:16,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:08:16,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:08:16,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:08:16,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:08:16,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:08:16,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:08:16,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:08:16,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:08:16,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:08:16,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:08:16,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:08:16,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:08:16,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:08:16,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:08:16,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:08:16,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:08:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:08:16,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:08:16,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:08:16,167 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 -> 599d022dfa4223d8bb6a36b0b4d4c23924feae264573646d696cb51987d3d57a [2024-11-07 22:08:16,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:08:16,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:08:16,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:08:16,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:08:16,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:08:16,463 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_max_multiply_17_bad.i [2024-11-07 22:08:17,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:08:18,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:08:18,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_bad.i [2024-11-07 22:08:18,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e27f4b0f/437c2402227647e5bb87cf6e637d71eb/FLAG4cc0c1150 [2024-11-07 22:08:18,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e27f4b0f/437c2402227647e5bb87cf6e637d71eb [2024-11-07 22:08:18,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:08:18,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:08:18,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:08:18,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:08:18,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:08:18,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:08:18" (1/1) ... [2024-11-07 22:08:18,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc309f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:18, skipping insertion in model container [2024-11-07 22:08:18,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:08:18" (1/1) ... [2024-11-07 22:08:18,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:08:18,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:08:18,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:08:18,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:08:19,021 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:08:19,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19 WrapperNode [2024-11-07 22:08:19,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:08:19,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:08:19,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:08:19,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:08:19,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,073 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-07 22:08:19,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:08:19,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:08:19,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:08:19,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:08:19,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,094 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:08:19,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:08:19,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:08:19,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:08:19,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:08:19,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (1/1) ... [2024-11-07 22:08:19,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:08:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:08:19,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 22:08:19,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 22:08:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:08:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:08:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:08:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:08:19,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:08:19,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:08:19,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:08:19,427 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-07 22:08:19,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:08:19,436 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:08:19,437 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 22:08:19,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:19 BoogieIcfgContainer [2024-11-07 22:08:19,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:08:19,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:08:19,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:08:19,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:08:19,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:08:18" (1/3) ... [2024-11-07 22:08:19,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c06763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:08:19, skipping insertion in model container [2024-11-07 22:08:19,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:19" (2/3) ... [2024-11-07 22:08:19,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c06763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:08:19, skipping insertion in model container [2024-11-07 22:08:19,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:19" (3/3) ... [2024-11-07 22:08:19,447 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_17_bad.i [2024-11-07 22:08:19,461 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:08:19,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 22:08:19,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:08:19,525 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;@4ce40e5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:08:19,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 22:08:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 22:08:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 22:08:19,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:19,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:19,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1922939515, now seen corresponding path program 1 times [2024-11-07 22:08:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:08:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513690788] [2024-11-07 22:08:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:08:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:08:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:08:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:08:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513690788] [2024-11-07 22:08:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513690788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:08:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:08:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599515698] [2024-11-07 22:08:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:19,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:08:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:08:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:08:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:08:19,885 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:19,928 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-07 22:08:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:08:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 22:08:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:19,936 INFO L225 Difference]: With dead ends: 62 [2024-11-07 22:08:19,937 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 22:08:19,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:08:19,943 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:19,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 22:08:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-07 22:08:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-07 22:08:19,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2024-11-07 22:08:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:19,981 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-07 22:08:19,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-07 22:08:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 22:08:19,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:19,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:19,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 22:08:19,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:19,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash -534498815, now seen corresponding path program 1 times [2024-11-07 22:08:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:08:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288642508] [2024-11-07 22:08:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:08:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:08:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:08:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:08:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288642508] [2024-11-07 22:08:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288642508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 22:08:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101129198] [2024-11-07 22:08:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 22:08:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:08:20,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 22:08:20,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 22:08:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:20,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 22:08:20,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:08:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:08:20,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:08:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101129198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 22:08:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 22:08:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856137433] [2024-11-07 22:08:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:20,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 22:08:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:08:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 22:08:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 22:08:20,324 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:20,349 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-11-07 22:08:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 22:08:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 22:08:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:20,351 INFO L225 Difference]: With dead ends: 45 [2024-11-07 22:08:20,351 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 22:08:20,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 22:08:20,352 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:20,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 22:08:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 22:08:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-07 22:08:20,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2024-11-07 22:08:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:20,361 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-07 22:08:20,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-07 22:08:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 22:08:20,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:20,362 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 22:08:20,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 22:08:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 22:08:20,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1741121319, now seen corresponding path program 1 times [2024-11-07 22:08:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:08:20,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078406481] [2024-11-07 22:08:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:08:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:08:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:20,635 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 22:08:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:08:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078406481] [2024-11-07 22:08:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078406481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:08:20,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 22:08:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652853031] [2024-11-07 22:08:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:20,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 22:08:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:08:20,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 22:08:20,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 22:08:20,639 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:20,655 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-07 22:08:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 22:08:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-07 22:08:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:20,657 INFO L225 Difference]: With dead ends: 31 [2024-11-07 22:08:20,658 INFO L226 Difference]: Without dead ends: 19 [2024-11-07 22:08:20,658 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 22:08:20,659 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:20,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-07 22:08:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-07 22:08:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-07 22:08:20,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2024-11-07 22:08:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:20,667 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-07 22:08:20,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-07 22:08:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 22:08:20,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:20,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:20,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 22:08:20,670 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 22:08:20,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1859813884, now seen corresponding path program 1 times [2024-11-07 22:08:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:08:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877052179] [2024-11-07 22:08:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:08:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:08:20,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:08:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:08:20,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 22:08:20,712 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:08:20,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 22:08:20,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 22:08:20,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 22:08:20,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 22:08:20,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 22:08:20,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 22:08:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 22:08:20,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 22:08:20,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:08:20,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:08:20 BoogieIcfgContainer [2024-11-07 22:08:20,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:08:20,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:08:20,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:08:20,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:08:20,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:19" (3/4) ... [2024-11-07 22:08:20,756 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:08:20,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:08:20,758 INFO L158 Benchmark]: Toolchain (without parser) took 2532.02ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 88.2MB in the beginning and 101.2MB in the end (delta: -13.0MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-07 22:08:20,758 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:20,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 795.99ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 73.2MB in the end (delta: 14.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-07 22:08:20,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.39ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:20,759 INFO L158 Benchmark]: Boogie Preprocessor took 32.30ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 69.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:08:20,759 INFO L158 Benchmark]: RCFGBuilder took 330.96ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 57.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:08:20,759 INFO L158 Benchmark]: TraceAbstraction took 1312.90ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 56.8MB in the beginning and 101.2MB in the end (delta: -44.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-07 22:08:20,760 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 101.2MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:20,762 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.58ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 795.99ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 73.2MB in the end (delta: 14.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.39ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.30ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 69.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 330.96ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 57.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1312.90ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 56.8MB in the beginning and 101.2MB in the end (delta: -44.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 101.2MB 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: 1561]: 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_max_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = 0x7fffffff 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=0] [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] [L1559] COND TRUE data > 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] [L1561] data * 2 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: 1561]: 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, 33 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 72 mSDtfsCounter, 37 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 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 22:08:20,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_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 599d022dfa4223d8bb6a36b0b4d4c23924feae264573646d696cb51987d3d57a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:08:23,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:08:23,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 22:08:23,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:08:23,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:08:23,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 22:08:23,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:08:23,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:08:23,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:08:23,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:08:23,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:08:23,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:08:23,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:08:23,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:08:23,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:08:23,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:08:23,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:08:23,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:08:23,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 22:08:23,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:08:23,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:08:23,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:08:23,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:08:23,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:08:23,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:08:23,171 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 -> 599d022dfa4223d8bb6a36b0b4d4c23924feae264573646d696cb51987d3d57a [2024-11-07 22:08:23,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:08:23,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:08:23,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:08:23,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:08:23,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:08:23,427 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_max_multiply_17_bad.i [2024-11-07 22:08:24,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:08:25,153 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:08:25,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_bad.i [2024-11-07 22:08:25,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3ba8f531/17f161800ad744878e1cebe9a05a257d/FLAG2daf829fd [2024-11-07 22:08:25,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3ba8f531/17f161800ad744878e1cebe9a05a257d [2024-11-07 22:08:25,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:08:25,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:08:25,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:08:25,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:08:25,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:08:25,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:08:25" (1/1) ... [2024-11-07 22:08:25,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e374ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:25, skipping insertion in model container [2024-11-07 22:08:25,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:08:25" (1/1) ... [2024-11-07 22:08:25,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:08:25,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:08:25,873 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:08:25,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:08:26,073 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:08:26,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26 WrapperNode [2024-11-07 22:08:26,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:08:26,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:08:26,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:08:26,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:08:26,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,125 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-07 22:08:26,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:08:26,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:08:26,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:08:26,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:08:26,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,160 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:08:26,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:08:26,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:08:26,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:08:26,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:08:26,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (1/1) ... [2024-11-07 22:08:26,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:08:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:08:26,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 22:08:26,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 22:08:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:08:26,236 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:08:26,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:08:26,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:08:26,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:08:26,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:08:26,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:08:26,525 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 22:08:26,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:08:26,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:08:26,534 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 22:08:26,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:26 BoogieIcfgContainer [2024-11-07 22:08:26,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:08:26,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:08:26,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:08:26,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:08:26,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:08:25" (1/3) ... [2024-11-07 22:08:26,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b04839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:08:26, skipping insertion in model container [2024-11-07 22:08:26,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:08:26" (2/3) ... [2024-11-07 22:08:26,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b04839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:08:26, skipping insertion in model container [2024-11-07 22:08:26,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:26" (3/3) ... [2024-11-07 22:08:26,544 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_17_bad.i [2024-11-07 22:08:26,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:08:26,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 22:08:26,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:08:26,619 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;@242e9709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:08:26,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 22:08:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 22:08:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 22:08:26,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:26,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:26,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:26,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1922939515, now seen corresponding path program 1 times [2024-11-07 22:08:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:08:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463561240] [2024-11-07 22:08:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:08:26,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:08:26,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 22:08:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:26,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 22:08:26,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:08:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:08:26,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:08:26,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:08:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463561240] [2024-11-07 22:08:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463561240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:08:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 22:08:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668251500] [2024-11-07 22:08:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:26,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 22:08:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:08:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 22:08:26,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:08:26,788 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:26,799 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-07 22:08:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 22:08:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-07 22:08:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:26,806 INFO L225 Difference]: With dead ends: 55 [2024-11-07 22:08:26,806 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 22:08:26,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:08:26,813 INFO L432 NwaCegarLoop]: 35 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, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:26,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 22:08:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 22:08:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-07 22:08:26,859 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2024-11-07 22:08:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:26,860 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-07 22:08:26,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-07 22:08:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 22:08:26,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:26,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:26,866 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 22:08:27,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,062 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 22:08:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 518417235, now seen corresponding path program 1 times [2024-11-07 22:08:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:08:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969906098] [2024-11-07 22:08:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:08:27,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:08:27,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 22:08:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:27,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:08:27,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:08:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 22:08:27,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:08:27,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:08:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969906098] [2024-11-07 22:08:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969906098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:08:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:08:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921289735] [2024-11-07 22:08:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:27,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:08:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:08:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:08:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:08:27,202 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:27,234 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-07 22:08:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:08:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 22:08:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:27,237 INFO L225 Difference]: With dead ends: 42 [2024-11-07 22:08:27,237 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 22:08:27,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:08:27,238 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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 22:08:27,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 22:08:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 22:08:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-07 22:08:27,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2024-11-07 22:08:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:27,244 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-07 22:08:27,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-07 22:08:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 22:08:27,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:27,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:27,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 22:08:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 610405975, now seen corresponding path program 1 times [2024-11-07 22:08:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:08:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014411040] [2024-11-07 22:08:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:08:27,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:08:27,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 22:08:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:27,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 22:08:27,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:08:27,559 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 22:08:27,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 22:08:27,621 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 22:08:27,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:08:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014411040] [2024-11-07 22:08:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014411040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 22:08:27,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 22:08:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 22:08:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736099102] [2024-11-07 22:08:27,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 22:08:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 22:08:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:08:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 22:08:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 22:08:27,624 INFO L87 Difference]: Start difference. First operand 29 states and 32 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 22:08:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:27,658 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-07 22:08:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 22:08:27,658 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 22:08:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:27,659 INFO L225 Difference]: With dead ends: 42 [2024-11-07 22:08:27,659 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 22:08:27,660 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 22:08:27,660 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:27,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 22:08:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 22:08:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-07 22:08:27,667 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2024-11-07 22:08:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:27,667 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-07 22:08:27,667 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 22:08:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-07 22:08:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 22:08:27,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:27,668 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 22:08:27,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 22:08:27,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:27,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:27,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1741121319, now seen corresponding path program 1 times [2024-11-07 22:08:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:08:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82854414] [2024-11-07 22:08:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:08:27,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:08:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 22:08:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:08:27,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 22:08:27,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:08:27,960 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 22:08:27,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:08:27,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:08:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82854414] [2024-11-07 22:08:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82854414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:08:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:08:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 22:08:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834573643] [2024-11-07 22:08:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:08:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 22:08:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:08:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 22:08:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 22:08:27,964 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:08:27,978 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-07 22:08:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 22:08:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-07 22:08:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:08:27,979 INFO L225 Difference]: With dead ends: 30 [2024-11-07 22:08:27,979 INFO L226 Difference]: Without dead ends: 19 [2024-11-07 22:08:27,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 22:08:27,980 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:08:27,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:08:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-07 22:08:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-07 22:08:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-07 22:08:27,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2024-11-07 22:08:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:08:27,983 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-07 22:08:27,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 22:08:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-07 22:08:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 22:08:27,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:08:27,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:08:27,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 22:08:28,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:28,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-07 22:08:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:08:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1859813884, now seen corresponding path program 1 times [2024-11-07 22:08:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:08:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446264261] [2024-11-07 22:08:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:08:28,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:08:28,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:08:28,190 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 (6)] Waiting until timeout for monitored process [2024-11-07 22:08:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:08:28,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:08:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:08:28,284 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 22:08:28,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:08:28,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-07 22:08:28,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-07 22:08:28,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-07 22:08:28,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-07 22:08:28,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-07 22:08:28,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-07 22:08:28,293 INFO L540 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 (6)] Forceful destruction successful, exit code 0 [2024-11-07 22:08:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:08:28,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 22:08:28,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:08:28,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:08:28 BoogieIcfgContainer [2024-11-07 22:08:28,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:08:28,517 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:08:28,517 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:08:28,517 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:08:28,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:08:26" (3/4) ... [2024-11-07 22:08:28,520 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:08:28,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:08:28,521 INFO L158 Benchmark]: Toolchain (without parser) took 3314.01ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 53.5MB in the end (delta: 38.2MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-07 22:08:28,521 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:28,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.20ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 81.1MB in the end (delta: 10.4MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-11-07 22:08:28,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 78.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:08:28,522 INFO L158 Benchmark]: Boogie Preprocessor took 53.86ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:28,523 INFO L158 Benchmark]: RCFGBuilder took 355.03ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 62.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 22:08:28,524 INFO L158 Benchmark]: TraceAbstraction took 1978.02ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 54.1MB in the end (delta: 8.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-07 22:08:28,525 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 117.4MB. Free memory was 54.1MB in the beginning and 53.5MB in the end (delta: 636.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:08:28,526 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.20ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 81.1MB in the end (delta: 10.4MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 78.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.86ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 355.03ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 62.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1978.02ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 54.1MB in the end (delta: 8.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 117.4MB. Free memory was 54.1MB in the beginning and 53.5MB in the end (delta: 636.4kB). 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: 1561]: 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_max_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = 0x7fffffff 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=0] [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] [L1559] COND TRUE data > 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] [L1561] data * 2 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: 1561]: 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, 33 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 97 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 7/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 22:08:28,552 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