./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_09_good.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 4e9bda3e50dab498e3de1810c058a69f77db53aab215d3472e2bd22d9b37b57e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:23:48,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:23:48,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:23:48,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:23:48,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:23:48,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:23:48,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:23:48,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:23:48,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:23:48,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:23:48,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:23:48,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:23:48,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:23:48,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:23:48,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:23:48,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:23:48,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:23:48,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:23:48,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:23:48,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:23:48,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:23:48,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:23:48,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:23:48,758 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 -> 4e9bda3e50dab498e3de1810c058a69f77db53aab215d3472e2bd22d9b37b57e [2025-01-10 05:23:48,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:23:48,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:23:48,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:23:48,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:23:48,982 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:23:48,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_09_good.i [2025-01-10 05:23:50,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185c3e210/74d625d2d0754aec8d8ee9bdb041c1c1/FLAG8ec0d9c46 [2025-01-10 05:23:50,413 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:23:50,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_09_good.i [2025-01-10 05:23:50,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185c3e210/74d625d2d0754aec8d8ee9bdb041c1c1/FLAG8ec0d9c46 [2025-01-10 05:23:50,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185c3e210/74d625d2d0754aec8d8ee9bdb041c1c1 [2025-01-10 05:23:50,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:23:50,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:23:50,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:23:50,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:23:50,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:23:50,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:23:50" (1/1) ... [2025-01-10 05:23:50,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a85b5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:50, skipping insertion in model container [2025-01-10 05:23:50,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:23:50" (1/1) ... [2025-01-10 05:23:50,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:23:51,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:23:51,050 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:23:51,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:23:51,185 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:23:51,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51 WrapperNode [2025-01-10 05:23:51,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:23:51,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:23:51,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:23:51,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:23:51,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,232 INFO L138 Inliner]: procedures = 502, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 129 [2025-01-10 05:23:51,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:23:51,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:23:51,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:23:51,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:23:51,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,252 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-01-10 05:23:51,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:23:51,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:23:51,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:23:51,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:23:51,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (1/1) ... [2025-01-10 05:23:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:23:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:23:51,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 05:23:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:23:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:23:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:23:51,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 05:23:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 05:23:51,430 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:23:51,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:23:51,609 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-10 05:23:51,612 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:23:51,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:23:51,622 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:23:51,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:23:51 BoogieIcfgContainer [2025-01-10 05:23:51,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:23:51,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:23:51,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:23:51,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:23:51,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:23:50" (1/3) ... [2025-01-10 05:23:51,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1170880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:23:51, skipping insertion in model container [2025-01-10 05:23:51,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:23:51" (2/3) ... [2025-01-10 05:23:51,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1170880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:23:51, skipping insertion in model container [2025-01-10 05:23:51,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:23:51" (3/3) ... [2025-01-10 05:23:51,631 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_09_good.i [2025-01-10 05:23:51,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:23:51,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_multiply_09_good.i that has 3 procedures, 69 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 05:23:51,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:23:51,729 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;@1b6d8453, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:23:51,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 05:23:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 60 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 05:23:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 05:23:51,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:51,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:51,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 199500925, now seen corresponding path program 1 times [2025-01-10 05:23:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572993582] [2025-01-10 05:23:51,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:51,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 05:23:51,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 05:23:51,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:51,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:51,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:51,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572993582] [2025-01-10 05:23:51,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572993582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:51,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:23:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283381111] [2025-01-10 05:23:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:51,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:51,976 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 60 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-01-10 05:23:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,018 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2025-01-10 05:23:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-01-10 05:23:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,025 INFO L225 Difference]: With dead ends: 130 [2025-01-10 05:23:52,026 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 05:23:52,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,032 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 83 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 05:23:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 05:23:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2025-01-10 05:23:52,068 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 13 [2025-01-10 05:23:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,068 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2025-01-10 05:23:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-01-10 05:23:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2025-01-10 05:23:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 05:23:52,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:23:52,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2044654008, now seen corresponding path program 1 times [2025-01-10 05:23:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018615102] [2025-01-10 05:23:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 05:23:52,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 05:23:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018615102] [2025-01-10 05:23:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018615102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616467925] [2025-01-10 05:23:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,181 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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) [2025-01-10 05:23:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,220 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-01-10 05:23:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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 [2025-01-10 05:23:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,221 INFO L225 Difference]: With dead ends: 108 [2025-01-10 05:23:52,221 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 05:23:52,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,222 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 143 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 05:23:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-01-10 05:23:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 55 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-01-10 05:23:52,235 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 15 [2025-01-10 05:23:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-01-10 05:23:52,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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) [2025-01-10 05:23:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-01-10 05:23:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 05:23:52,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:23:52,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1040235118, now seen corresponding path program 1 times [2025-01-10 05:23:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87740287] [2025-01-10 05:23:52,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 05:23:52,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 05:23:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87740287] [2025-01-10 05:23:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87740287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444178324] [2025-01-10 05:23:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,337 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,385 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-01-10 05:23:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 05:23:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,387 INFO L225 Difference]: With dead ends: 63 [2025-01-10 05:23:52,387 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 05:23:52,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,388 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 05:23:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 05:23:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-01-10 05:23:52,404 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 16 [2025-01-10 05:23:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,404 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-01-10 05:23:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-01-10 05:23:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 05:23:52,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:23:52,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -177237038, now seen corresponding path program 1 times [2025-01-10 05:23:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859583917] [2025-01-10 05:23:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 05:23:52,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 05:23:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859583917] [2025-01-10 05:23:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859583917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876007013] [2025-01-10 05:23:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,557 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-10 05:23:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,606 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2025-01-10 05:23:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2025-01-10 05:23:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,609 INFO L225 Difference]: With dead ends: 93 [2025-01-10 05:23:52,609 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 05:23:52,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,610 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 05:23:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 05:23:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2025-01-10 05:23:52,627 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 21 [2025-01-10 05:23:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,628 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-01-10 05:23:52,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-10 05:23:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2025-01-10 05:23:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 05:23:52,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:23:52,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1199380771, now seen corresponding path program 1 times [2025-01-10 05:23:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914800573] [2025-01-10 05:23:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 05:23:52,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 05:23:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914800573] [2025-01-10 05:23:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914800573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924919208] [2025-01-10 05:23:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,728 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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) [2025-01-10 05:23:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,741 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2025-01-10 05:23:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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 22 [2025-01-10 05:23:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,742 INFO L225 Difference]: With dead ends: 65 [2025-01-10 05:23:52,742 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 05:23:52,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,743 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 05:23:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 05:23:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 55 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-01-10 05:23:52,747 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 22 [2025-01-10 05:23:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,747 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-01-10 05:23:52,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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) [2025-01-10 05:23:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2025-01-10 05:23:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 05:23:52,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:23:52,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1107896381, now seen corresponding path program 1 times [2025-01-10 05:23:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857987088] [2025-01-10 05:23:52,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 05:23:52,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 05:23:52,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857987088] [2025-01-10 05:23:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857987088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409519768] [2025-01-10 05:23:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,813 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,823 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-01-10 05:23:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 05:23:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,824 INFO L225 Difference]: With dead ends: 64 [2025-01-10 05:23:52,824 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 05:23:52,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,825 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 05:23:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-10 05:23:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3125) internal successors, (63), 54 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-01-10 05:23:52,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2025-01-10 05:23:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,831 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-01-10 05:23:52,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-01-10 05:23:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 05:23:52,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:23:52,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash 14950698, now seen corresponding path program 1 times [2025-01-10 05:23:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917534880] [2025-01-10 05:23:52,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 05:23:52,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 05:23:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:52,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917534880] [2025-01-10 05:23:52,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917534880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343656744] [2025-01-10 05:23:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,867 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,879 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2025-01-10 05:23:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 05:23:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,880 INFO L225 Difference]: With dead ends: 76 [2025-01-10 05:23:52,880 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 05:23:52,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,881 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 05:23:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 05:23:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 57 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:23:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2025-01-10 05:23:52,885 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 25 [2025-01-10 05:23:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,885 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2025-01-10 05:23:52,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:23:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2025-01-10 05:23:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 05:23:52,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:23:52,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1427043440, now seen corresponding path program 1 times [2025-01-10 05:23:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005983697] [2025-01-10 05:23:52,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 05:23:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 05:23:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:23:52,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:52,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005983697] [2025-01-10 05:23:52,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005983697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:52,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:23:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692689102] [2025-01-10 05:23:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:52,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:52,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:52,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,921 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-10 05:23:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:52,926 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2025-01-10 05:23:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 30 [2025-01-10 05:23:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:52,927 INFO L225 Difference]: With dead ends: 107 [2025-01-10 05:23:52,927 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 05:23:52,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:52,931 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:52,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 05:23:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 05:23:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:23:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2025-01-10 05:23:52,935 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 30 [2025-01-10 05:23:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-01-10 05:23:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-10 05:23:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2025-01-10 05:23:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 05:23:52,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:52,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 05:23:52,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2043532217, now seen corresponding path program 1 times [2025-01-10 05:23:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176351849] [2025-01-10 05:23:52,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:52,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 05:23:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 05:23:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176351849] [2025-01-10 05:23:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176351849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631436252] [2025-01-10 05:23:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:53,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:53,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:53,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:53,005 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:23:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:53,015 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-01-10 05:23:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-01-10 05:23:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:53,017 INFO L225 Difference]: With dead ends: 60 [2025-01-10 05:23:53,017 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 05:23:53,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:53,017 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:53,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 05:23:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 05:23:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 05:23:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-01-10 05:23:53,025 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 35 [2025-01-10 05:23:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-01-10 05:23:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:23:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-01-10 05:23:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 05:23:53,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:23:53,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:53,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 05:23:53,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:23:53,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:23:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1075010547, now seen corresponding path program 1 times [2025-01-10 05:23:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:23:53,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112116379] [2025-01-10 05:23:53,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:23:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:23:53,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 05:23:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 05:23:53,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:23:53,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:23:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:23:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:23:53,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112116379] [2025-01-10 05:23:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112116379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:23:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:23:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:23:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651449710] [2025-01-10 05:23:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:23:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:23:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:23:53,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:23:53,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:53,080 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:23:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:23:53,089 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-01-10 05:23:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:23:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 05:23:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:23:53,090 INFO L225 Difference]: With dead ends: 59 [2025-01-10 05:23:53,090 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:23:53,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:23:53,090 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:23:53,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:23:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:23:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:23:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 05:23:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:23:53,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-01-10 05:23:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:23:53,091 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:23:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:23:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:23:53,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 05:23:53,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 05:23:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 05:23:53,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:23:53,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:23:53,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:23:53,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:23:53 BoogieIcfgContainer [2025-01-10 05:23:53,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:23:53,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:23:53,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:23:53,206 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:23:53,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:23:51" (3/4) ... [2025-01-10 05:23:53,208 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:23:53,212 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:23:53,212 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:23:53,217 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 05:23:53,218 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 05:23:53,218 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 05:23:53,218 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:23:53,218 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:23:53,355 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:23:53,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:23:53,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:23:53,360 INFO L158 Benchmark]: Toolchain (without parser) took 2916.45ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 134.7MB in the end (delta: -6.7MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2025-01-10 05:23:53,360 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:23:53,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.62ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 68.9MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 05:23:53,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 66.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:23:53,360 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 64.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:23:53,360 INFO L158 Benchmark]: RCFGBuilder took 354.75ms. Allocated memory is still 167.8MB. Free memory was 63.3MB in the beginning and 46.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 05:23:53,361 INFO L158 Benchmark]: TraceAbstraction took 1581.16ms. Allocated memory is still 167.8MB. Free memory was 46.6MB in the beginning and 57.9MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:23:53,361 INFO L158 Benchmark]: Witness Printer took 152.65ms. Allocated memory is still 167.8MB. Free memory was 57.9MB in the beginning and 134.7MB in the end (delta: -76.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-01-10 05:23:53,362 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.21ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.62ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 68.9MB in the end (delta: 59.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 66.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 64.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 354.75ms. Allocated memory is still 167.8MB. Free memory was 63.3MB in the beginning and 46.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1581.16ms. Allocated memory is still 167.8MB. Free memory was 46.6MB in the beginning and 57.9MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 152.65ms. Allocated memory is still 167.8MB. Free memory was 57.9MB in the beginning and 134.7MB in the end (delta: -76.8MB). Peak memory consumption was 9.1MB. 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 - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 1187 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 693 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 05:23:53,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE